Special Pairs
CodeChefOpen on judge ↗
Let us define a pair of integers to be special if they have no common divisors greater than 1. Given a pair of integers, (a,b), verify whether they are special or not. Input The first line of input consists of a single integer T denoting the number of test cases. Each of the T subsequent lines consists of two space separated integers a and b. Output For every test case, print “yes” or “no”
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