XOR and AND

CodeChefRating 1625Open on judge ↗

Alice has an array $A$ of length $N$. She is interested in finding the number of pairs $(i, j)$ such that $1\leq i \lt j \leq N$ and $A_i \oplus A_j \lt A_i \& A_j$. $\oplus$ represents the [Bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operator. $\&$ represents the [Bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) operator. ### Input - The first line of inpu

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