← All problemsSign in

Bhai ab toh pucca vhi hai

You are given two integers $A$ and $B$. Your task is to find the number of pairs $(a,b)$ which satisfy the following conditions: - $GCD(a,b)=1$ - $1 \leq a \leq A$ - $1 \leq b \leq B$ Note: Here, $GCD(a,b)$ is the *greatest common divisor* of $a$ and $b$. ###Input: - First line contains a single integer $T$ denoting the number of test cases. - Each of the following $T$ lines has two space-separ

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

Sign in to chat with the tutor and save your progress.

Sign in to start