| # | User | Rating |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | ecnerwala | 3654 |
| 3 | jiangly | 3627 |
| 4 | jqdai0815 | 3620 |
| 5 | orzdevinwang | 3612 |
| 6 | Benq | 3586 |
| 7 | Radewoosh | 3582 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3474 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 4 | atcoder_official | 153 |
| 6 | -is-this-fft- | 148 |
| 6 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 145 |
| 10 | cry | 144 |
Interesting XOR problem
Given an odd positive integer $$$n>3$$$, consider the binary array of length $$$n$$$ with the first and last elements are ones and all other are zeros. What is the total number of different sequences can be obtained by applying the following operation any number of times: let b be the binary array of length $$$n$$$ such that for $$$1\le i\le n$$$ b[i]=a[i] $$$\oplus$$$ a[i mod n+1]
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
pupsicek | 2024-07-30 20:55:27 | 175 | (published) | |
| en4 |
|
pupsicek | 2024-07-30 20:50:53 | 1234 | Tiny change: ' this.\n\n</spoi' -> ' this.\n\n\n</spoi' | |
| en3 |
|
pupsicek | 2024-07-30 19:35:09 | 543 | ||
| en2 |
|
pupsicek | 2024-07-30 18:50:25 | 2388 | Tiny change: 'integer $n>3$, consid' -> 'integer $n\ge 3$, consid' | |
| en1 |
|
pupsicek | 2024-07-30 17:15:12 | 419 | Initial revision (saved to drafts) |
