Codeforces 1152C

求最小的 k k k 使得 l c m ( a + k , b + k ) lcm(a+k,b+k) lcm(a+k,b+k) 最小。html l c m ( a + k , b + k ) = ( a + k ) ( b + k ) g c d ( a + k , b + k ) = ( a + k ) ( b + k ) g c d ( a + k , a − b ) lcm(a+k,b+k)

>>阅读原文<<