Time Limit: 0.1 seconds (C/C++)
Memory Limit: 256 megabytes
You are given two natural numbers A and B. Determine the natural number N such that the least
common multiple of the numbers A + N and B + N is minimal.
Input
The only line of the input contains two natural numbers: A and B. None of them is exceeding 109
.
Output
Output the natural number N such that LCM(A + N, B + N) is minimal. If there are several values
of N which yield the minimum, output the smallest one.
acm
Sample input Sample output
4 10
2
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<set>
#include<algorithm>
#include<iostream>
#include<string>
#include<climits>
#include<map>
using namespace std;
typedef long long ll;
const ll inf = LLONG_MAX;
set<ll> s;
set<ll>::iterator p;
ll gcd(ll a,ll b){
if(b == 0)
return a;
else
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
void factor(ll n){//求因子
s.insert(1);
s.insert(n);
ll temp,now;
temp = (ll)((double)sqrt((double)n)+1);
now = n;
for(ll i = 2;i <= temp;i++)
if(now%i == 0){
s.insert(i);
s.insert(now/i);
}
if(now != 1)
s.insert(now);
}
int main(){
ll a,b;
while(cin>>a>>b){
if(a == b)
cout << 1 << endl;
else {
ll res = inf;
s.clear();
ll number = abs(a - b);
factor(number);
ll ans = inf;
for(p=s.begin();p!=s.end();p++){
ll n = (*p) - a% (*p);
if(lcm(a+n,b+n) < res){
res = lcm(a+n,b+n);
ans = n;
}else if(lcm(a+n,b+n) == res){
ans = min(ans,n);
}
}
cout << ans << endl;
}
}
return 0;
}