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 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | atcoder_official | 160 |
| 5 | Um_nik | 159 |
| 6 | djm03178 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 151 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/02/2025 14:03:37 (i2).
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.