Good Pairs

CodeChefOpen on judge ↗

Chef has two arrays $A$ and $B$, each of length $N$. A pair $(i,j)$ $(1 \leq i \lt j \leq N)$ is said to be a good pair if and only if $$A_i \oplus A_j = B_i \oplus B_j$$ Here, $\oplus$ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation. Determine the number of good pairs. ### Input - The first line of input will contain a single integer $T$, denoting the

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