若一个十进制2^k,写成100000...的形式。
例如：
2^4:10000 ，则在此情况下，在10000到11111这些数中，任意两个数XOR，结果都小于10000。 而若是10000(2^k)与比他小并相邻的数(1111)XOR，则会得到2^k级的最大数11111
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
The XOR in Some Situation
Revision en2, by Code_quantum, 2022-02-14 12:25:09
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Code_quantum | 2022-08-14 05:48:09 | 9 | Tiny change: 'finition :\n1. Numbe' -> 'finition : \n1. Numbe' | |
| en3 |
|
Code_quantum | 2022-08-14 05:44:35 | 393 | ||
| en2 |
|
Code_quantum | 2022-02-14 12:25:09 | 24 | ||
| en1 |
|
Code_quantum | 2022-02-14 12:24:06 | 174 | 初步修订 (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/18/2026 13:02:25 (f1).
Desktop version, switch to mobile version.
Supported by
