Maximize GCD

CodeChefOpen on judge ↗

Given two numbers a and b. You can change any one of them to any number such that GCD(a,b) is maximum. **GCD(a,b) is greatest common divisor of a and b.** ### Input First line contain the number of test cases t. Next t line contain two space separated integer a and b. ### Output For each test case print a single integer the maximum value of gcd that can be generated. ### Constraints $1\leq t

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