Alan & Binary Numbers

CodeChefOpen on judge ↗

Christopher wants to test Alan on his skill with binary numbers. He gives him 2 **positive** numbers $A$ & $B$ in binary format having $N$ bits each. In 1 move, Alan is allowed to take any 1 of these numbers & divide it by $2$ (integer division / floor division) Christopher asks him to find the **minimum** number of moves $X$ required to make the **bitwise XOR** of $A$ with $B$ **even*

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