Prime Xor
For $3$ **distinct prime** integers $A, B,$ and $C$ $(1 \lt A,B,C \lt 2^{30})$, we define positive integers $X, Y,$ and $Z$ as: $X = A\oplus B, Y = B\oplus C,$ and $Z = C\oplus A$, where $\oplus $ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation. Given only **two** integers $X$ and $Y$ and the fact that **at least one** integer amongst $X, Y,$ and $Z$ is
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