Given an array of n-2 unique numbers in range 1 to n (inclusive). I want to find the missing two numbers in the array using xor. Please help me providing the idea. Thanks in advance.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 03:28:29 (l2).
Desktop version, switch to mobile version.
Supported by
May I wrong...
Maximum you may get : xor of missing two numbers. But xor of different numbers may be equal. See http://rextester.com/BBMAI41221 , so I think that you cannot find this two numbers from XOR operation.
Let your's missing numbers 2*m , and 2*m + 1, but for any m : (2*m) XOR (2*m+1) = 1. How you can find they??
Why you do not use simplist way:
bool visit[n]array )) ? It's O(n) algo, and O(n) memory.