← All problemsSign in

Pairwise Xors

CodeChefRating 1609Open on judge ↗

JJ gives Chef a number $X$ and challenges Chef to come up with three **distinct** numbers $A,$ $B,$ and $C$ such that: - $0 \le A, B, C \lt 2^{30}$; - $(A \oplus B) + (B \oplus C) + (C \oplus A) = X$. Help Chef come up with three such numbers or determine that no such tuple exists. Here, $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). ### Input

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