数论 +思维 codeforces div2 554C.C. Neko does Maths

题意

给 a b两个数
求 k 使a+k 和 b+k 的lcs最小

思路

假设 a+k 和b+k的gcd为t


所以

t是其因子
此时

AC代码

#include<bits/stdc++.h>
#define endl "\n"
#define INF 0x3f3f3f3f3f3f3f
typedef long long ll;
const ll mod = 1e9 + 7;
const double PI = acos(-1.0);
const double EI = exp(1.0);
const int N = 1e6 + 50;
const int maxn = 2 * N;
const double eps = 1e-8;
using namespace std;
ll fast_pow(ll a, ll b)
{
	ll ans = a, res = 1;
	while (b > 0)
	{
		if (b & 1)
			res = (res * ans) % mod;
		ans = (ans * ans) % mod;
		b /= 2;
	}
	return res;
}
ll inv(ll x) { return fast_pow(x, mod - 2); }
ll gcd(ll a, ll b) 
{
	if (a % b == 0)return b;
	else return gcd(b, a % b);
}
vector<int>q;
void fact(int x)
{

	for (int i = 1; i * i <= x; i++)
	{
		q.push_back(i);
		q.push_back(x / i);
	}

}
void solve()
{
	ll a, b,k=0;
	cin >> a >> b;
	ll minl = a / gcd(a, b)*b;
	ll gap = max(a, b) - min(a, b);
	fact(gap);
	for (auto t : q)
	{
		ll z = (t-a%t);
		ll m = (a + z) / gcd(a + z, b + z) * (b + z);
		if (m < minl)
		{
			minl = m;
			k=z;
		}
	}
	cout << k << endl;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(); cout.tie(0);
	//int t; cin >> t; while (t--)
		solve();
	return 0;
}