C. Neko does Maths
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Neko loves divisors. During the latest number theory lesson, he got an interesting exercise from his math teacher.
Neko has two integers aa and bb. His goal is to find a non-negative integer kk such that the least common multiple of a+ka+k and b+kb+k is the smallest possible. If there are multiple optimal integers kk, he needs to choose the smallest one.
Given his mathematical talent, Neko had no trouble getting Wrong Answer on this problem. Can you help him solve it?
Input
The only line contains two integers aa and bb (1≤a,b≤1091≤a,b≤109).
Output
Print the smallest non-negative integer kk (k≥0k≥0) such that the lowest common multiple of a+ka+k and b+kb+k is the smallest possible.
If there are many possible integers kk giving the same value of the least common multiple, print the smallest one.
Examples
input
Copy
6 10
output
Copy
2
input
Copy
21 31
output
Copy
9
input
Copy
5 10
output
Copy
0
Note
In the first test, one should choose k=2k=2, as the least common multiple of 6+26+2 and 10+210+2 is 2424, which is the smallest least common multiple possible.
分析:众所周知,gcd(a,b)一定是(a-b)的因子,那么直接枚举a-b的因子就可以了。最后判断一下k=0的情况即可。
#include "bits/stdc++.h"
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long c = abs(a - b);
vector<long long> v;
for (long long i = 1; i * i <= c; ++i) {
if (c % i == 0) {
if (i != 1)
v.push_back(i);
if (i * i != c)v.push_back(c / i);
}
}
sort(v.begin(), v.end());
long long mini = 8e18;
long long ans;
for (int i = 0; i < v.size(); ++i) {
long long x = a + v[i] - a % v[i];
long long y = b + v[i] - b % v[i];
if (x * y / v[i] < mini) {
mini = x * y / v[i];
ans = x - a;
}
}
if (mini >= a * b / __gcd(a, b))ans = 0;
printf("%lld\n", ans);
}