Think and Compute

CodeChefOpen on judge ↗

Mr. Garg is challenging you to write a program that takes two non - negative integers $X$ and $Y$ as an input and output a single non - negative integer $Z$, which is equivalent to $X' * Y'$. $X'$ and $Y'$ satisfy the following two conditions: - $X = X' + Y'$, - $Y = X' \oplus Y'$, where $\oplus$ is bit-wise exclusive or. Since $Z$ can be large, output $Z$ modulo 1000000007 ($10^9 + 7$

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