Did you know that the minimum XOR pair of an array can be found by sorting the array, then checking the XOR of adjacent elements.
Can anyone prove why?
Please read the new rule regarding the restriction on the use of AI tools. It applies starting from round 972.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 161 |
| 1 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | awoo | 158 |
| 4 | -is-this-fft- | 158 |
| 6 | atcoder_official | 157 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/16/2024 22:30:39 (i1).
Desktop version, switch to mobile version.
Supported by
