Chef and Prime Divisors

CodeChefRating 1720Open on judge ↗

You are given two positive integers – A and B. You have to check whether A is divisible by all the prime divisors of B. Input The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. For each test case, you are given two space separated integers – A and B. Output For each test case, output "Yes" (without quotes) if A cont

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