Tale of Two Primes

CodeChefOpen on judge ↗

No long stories to read here. Let's get straight to the question. You have to answer the following question $Q$ times: Given two numbers $x$ and $y$ such that $x \le y$, find the number of distinct prime factors that they have in common (For example, $4$ and $8$ have only $1$ common prime factor). ### Input - The first line of the input will contain $Q$, the number of times you have to answer 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