Problem - C - Codeforces
题目大意:给定 a , b a,b a,b,求出最小的k使得 l c m ( a + k , b + k ) lcm(a+k, b+k) lcm(a+k,b+k)最小.
解题思路:根据gcd的性质可以得到 g c d ( a + k , b + k ) = g c d ( a − b , b + k ) gcd(a+k, b+k)=gcd(a-b, b+k) gcd(a+k,b+k)=gcd(a−b,b+k), l c m ( a + k , b + k ) =