← All problemsSign in

GCD and LCM

CodeChefRating 1419Open on judge ↗

Alice and Bob are playing a game. They have two positive integers $X$ and $Y$. In one operation: - First Alice would replace **exactly one** of the numbers with the [gcd](https://en.wikipedia.org/wiki/Greatest_common_divisor) of current numbers. In words, she would select either $X$ or $Y$ and replace it with $\gcd(X,Y)$. - Then Bob would replace **exactly one** of the numbers with the [lcm](ht

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