Start Here

CodeChefOpen on judge ↗

You're given two integers $N$ and $M$. Find if there exists a number which is multiple of one and divisor of the other. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains two space separated integers $N$ and $M$. ### Output For each testcase, output in a single line the answer to that test case: 'Yes' if the number exists, 'No' if it

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