Build Sum
You are given three integers $X_1$, $X_2$, and $X_3$. You are allowed to perform the following operation any number of times on them: - Choose a non-negative integer $Y$ such that $0 \le Y < 10^{18}$. - Select two distinct indices $i$ and $j$ from $(1, 2, 3)$. - Update the numbers as follows: $X_i \gets X_i \oplus Y $ and $ X_j \gets X_j \oplus Y$. where $\oplus$ denotes the [bitwise XOR](https
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