Pushkar Pair

CodeChefOpen on judge ↗

Pushkar is very good in *Number Theory*. He takes two numbers $A\ and\ B$ and declares them a *Pushkar Pair*. Pushkar Pair has a property that $A$ has a $Modular\ Inverse$ modulo $B$. He asks you to tell him the largest number $L$ that divides both of them. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single l

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