← All problemsSign in

XOR Equal

CodeChefRating 1731Open on judge ↗

You are given an array $A$ consisting of $N$ integers and an integer $X$. Your goal is to have as many equal integers as possible in the array. To achieve this goal, you can do the following operation: - Choose an index $i$ $(1 \leq i \leq N)$ and set $A_i = A_i \oplus X$, where $\oplus$ denotes the [bitwise xor operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). Find the maximum n

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