Missing Numbers

CodeChefOpen on judge ↗

Vivek has $N$ integers in the range $[0, 2^{30})$ in his bag. He gives it to Adarsh, expecting him to take care of it. However, Adarsh misplaced $K$ numbers from the bag. Now, Adarsh has the following information: - The bitwise XOR of all the numbers. - The bitwise XOR of missing numbers is greater than or equal to their sum. - The rest of the $N$ - $K$ numbers. With this information, he reache

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI