- lcm=n∗m/gcd \textbf{lcm=n∗m/gcd} lcm=n∗m/gcd
- n+k和m+k的lcm要变小,那么加k之后肯定有更大的最大公因数,那么假设他们加上k之后拥有了公因数z
- 满足公式 (n+k) mod z ==(m+k) mod z \textbf{\textit{(n+k) mod z ==(m+k) mod z}} (n+k) mod z ==(m+k) mod z
- 即 n mod z==m mod z \textbf{\textit{n mod z==m mod z}} n mod z==m mod z
- 再合并一下变成: (n−m) mod z=0 \textbf{\textit{(n−m) mod z=0}} (n−m) mod z=0,n>m;
- 这个公式说明n和m加上k之后产生的最大公因数必然是n-m的因子。这样就很简单了,直接把差值计算出来,然后将所有的因子找出来,每一次带入判定就行了。有一点很坑的就是k==0,这个时候也是最小公倍数最小的情况,需要特判一下。
AC代码:
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", (n))
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const int maxn = 3e5 + 5;
const int INF = 0x3f3f3f3f;
const long long inf=1e18+5;
inline int read()
{
int ret = 0, sgn = 1;
char ch = getchar();
while(ch < '0' || ch > '9')
{
if(ch == '-')
sgn = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
ret = ret*10 + ch - '0';
ch = getchar();
}
return ret*sgn;
}
inline void Out(int a) //Êä³öÍâ¹Ò
{
if(a>9)
Out(a/10);
putchar(a%10+'0');
}
int qpow(int m, int k, int mod)
{
int res = 1, t = m;
while (k)
{
if (k&1)
res = res * t % mod;
t = t * t % mod;
k >>= 1;
}
return res;
}
ll gcd(ll a,ll b)
{
return b==0?a : gcd(b,a%b);
}
ll a,b;
ll i,j,k;
vector<ll> v;
int main()
{
cin>>a>>b;
if(a>b)
{
swap(a,b);
}
k=b-a;
for(i=1; i*i<=k; i++)
{
if(k%i==0)
{
v.push_back(i);
v.push_back(k/i);
}
}
int len=v.size();
ll temp=inf;
ll ans;
for(i=0; i<len; i++)
{
ll x=v[i];
ll t=0;
if(a%x!=0)///不加这个就不是最小的
{
t=x-a%x;
}
ll lcm=0;
lcm=(a+t)*(b+t)/gcd(a+t,b+t);
if(lcm<temp)
{
temp=lcm;
ans=t;
}
}
if(a==b)
ans=0;
cout<<ans<<endl;
}