Equivalent Numbers
Chef calls a pair of integers $(A, B)$ *equivalent* if there exist some **positive** integers $X$ and $Y$ such that $A^X = B^Y$. Given $A$ and $B$, determine whether the pair is *equivalent* or not. ### 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$, as mentioned in statem
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