Positional XOR

CodeChefOpen on judge ↗

Help Ashish to solve this problem. You are given a positive integer $N$ which is equal to the bit-wise xor of some numbers. There exists an array $A$ of length $64$ which contains the count of set bits at respective indices of all those numbers from which integer $N$ was computed. 1 0 1 0 1 ..... 0 1 1 1 1 .....

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