Possible GCD

CodeChefRating 1297Open on judge ↗

Chef has two **distinct** positive integers $A$ and $B$. Chef wonders how many distinct values are possible for the expression $\mathrm{gcd}(A+X,B+X)$, where $X$ can take any non-negative integer value. Help Chef find this value. Here, $\mathrm{gcd}$ stands for [Greatest Common Divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor). ### Input - The first line contains a single intege

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