Large Gcd (Keteki)

CodeChefOpen on judge ↗

Find the biggest integer d, such that all integers a, a + 1, a + 2, ..., b are divisible by d. Note: Large Constraints. Input: First line contains integer T (TOutput: Output one integer — greatest common divisor of all integers from a to b inclusive. Constraints 1 Sample Input: 2 1 2 1 1 Sample Output: 1 1

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