← All problemsSign in

Echo

CodeChefRating 2026Open on judge ↗

You are given an array $A$ of length $N$, and an integer $P$. In one operation, you may pick any index $i$ with $2 \le i \le N-1$ and update both of its neighbours simultaneously: - $A_{i-1} \;\gets\; A_{i-1} \oplus A_i$ - $A_{i+1} \;\gets\; A_{i+1} \oplus A_i$ Here $\oplus$ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation. Note that $A_i$ itself is **not

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