← All problemsSign in

Prefix XORs

CodeChefRating 3078Open on judge ↗

Chef has an array $A$ such that $A_i = i$. A *transform* on the array is performed by replacing each element of the array with the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of the prefix till that element. For example, if $B$ denotes the array after performing *transform* on array $A$, then, $B_i = A_1 \oplus A_2 \oplus \ldots \oplus A_i$. Similarly, if $C$ denotes the ar

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

Sign in to chat with the tutor and save your progress.

Sign in to start