Make A and B equal
Chef has two numbers $A$ and $B$. In one operation, Chef can choose either $A$ or $B$ and multiply it by $2$. Determine whether he can make both $A$ and $B$ equal after any number (possibly, zero) of moves. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of two space-separated integers $A$ and $B$. ### Output F
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