Order by XOR
You are given three **distinct** integers $A, B,$ and $C$. Find **any** integer $X \ (0 \leq X < 2^{30})$ such that: $(A \oplus X) \lt (B \oplus X) \lt (C \oplus X)$, where $\oplus$ denotes the [Bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). If no such $X$ exists, print $-1$ instead. ### Input - The first line of the input contains a single integer $T$, the numb
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.
Sign in to chat with the tutor and save your progress.
Sign in to start