Good XOR

CodeChefOpen on judge ↗

An binary array is called *good*, if the count of ones in the array is equal to the count of zeros. Chef has a binary array $A$ of size $N$. He wants to make the array *good* using the following type of operation: - Select two indices $i$ and $j$ $(i \neq j)$ and set both $A_i$ and $A_j$ as $A_i\oplus A_j$, where $\oplus$ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#X

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