Codeforces Round #554 (Div. 2) C. Neko does Maths

题目大意

给出两个数$a,b$，
求最小的$k\ge 0$，使得$LCM(a+k,b+k)$最小。

时间限制

1s

数据范围

$a,b\le 10^9$

题解

已知$LCD(a,b)=\frac{a\times b}{\gcd (a,b)}$
如果直接枚举$k$显然不现实，
考虑枚举$gcd$，不妨假设$a>b$
对于$\gcd (a+k,b+k)=\gcd (b+k,a-b)$
因此，只需要枚举$a-b$的因数，
然后通过计算出$b+k$，得出$k$，进而可以计算$LCM$。
对应于质因数分解，请看这里。

Code

//#pragma GCC optimize (2)
//#pragma G++ optimize (2)
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#define G getchar
#define ll long long
using namespace std;

ll read()
{
    char ch;
    for(ch = G();(ch < '0' || ch > '9') && ch != '-';ch = G());
    ll n = 0 , w;
    if (ch == '-')
    {
        w = -1;
        ch = G();
    } else w = 1;
    for(;'0' <= ch && ch <= '9';ch = G())n = (n<<1)+(n<<3)+ch-48;
    return n * w;
}

const int N = 100003;
ll n , ans , ans1;
ll pri[N] , k[N] , m;
int ss[16] = {2 , 3 , 5 , 7 , 11 ,13 , 17 , 19 , 23 , 29 , 325 , 9375 , 28187 , 450775 , 9870504 , 1795265022};

ll mul (ll a , ll b , ll p) //a*b%p
{
    /*ll s = 0;
    for ( ; b ; )
    {
        if (b & 1) s = (s + a) % p;
        a = (a + a) % p;
        b = b >> 1;
    }
    return s;*/
    ll s = a * b - (ll)((long double) a * b / p +0.5) * p;
    return s < 0 ? s + p : s;
}

ll ksm (ll x , ll y , ll p)
{
    ll s = 1;
    for ( ; y ; )
    {
        if (y & 1) s = mul(s , x , p);
        x = mul (x , x , p);
        y = y >> 1;
    }
    return s;
}

bool MR_detect (ll n , ll a)
{
    if (n == a) return 1;
    if (a % n == 0) return 1;
    if (ksm(a , n - 1 , n) != 1) return 0;
    ll p = n - 1 , lst = 1;
    for ( ; ((p & 1) ^ 1) && lst == 1 ; )
    {
        p = p >> 1;
        lst = ksm(a , p , n);
        if (lst != 1 && lst != n - 1) return 0;
    }
    return 1;
}

bool MR(ll  n)
{
    if (n < 2) return 0;
    for (int i = 0 ; i < 16 ; i ++)
        if (! MR_detect(n , ss[i])) return 0;
    return 1;
}

ll F(ll x , ll C , ll p)
{
    return (mul(x , x , p) + C) % p;
}

ll gcd(ll a , ll b)
{
    return a % b ? gcd(b , a % b) : b;
}

ll Rand()
{
    return (ll)rand() + ((ll)rand() << 15) + ((ll)rand() << 30) + ((ll)rand() << 45);
}

ll PR(ll n)
{
    if (MR(n)) return n;
    if (n == 4) return 2;
    for ( ; ; )
    {
        ll C = Rand() % (n - 1) + 1;
        ll p1 = 0 , p2 = 0;
        ll s = 1 , tmp;
        for ( ; ; )
        {
            for (int i = 0 ; i < 128 ; i++)
            {
                p2 = F(F(p2 , C , n) , C , n);
                p1 = F(p1 , C , n);
                tmp = mul(s , abs(p1 - p2) , n);
                if (tmp == 0 || p1 == p2) break;
                s = tmp;
            }
            tmp = gcd(n , s);
            if (tmp > 1) return tmp;
            if (p1 == p2) break;
        }
    }
}

ll a , b;

void dfs(int x , ll d)
{
    if (x > m)
    {
        ll tmp = b / d;
        if (b % d) tmp++;
        ll tb = tmp * d;
        ll ta = a + tb - b;
        tmp = tmp * ta;
        if (tmp < ans || (tmp == ans && ta - a < ans1))
        {
            ans = tmp;
            ans1 = ta - a;
        }
        return;
    }
    ll tmp = 1;
    for (int i = 0 ; i <= k[x] ; i++)
    {
        dfs(x + 1 , d * tmp);
        tmp = tmp * pri[x];
    }
}

int main()
{
    //freopen("1.txt","r",stdin);
    //freopen("2.txt","w",stdout);

    srand((unsigned)0);
    //printf("350\n");
    //for (int i = 1 ; i <= 350 ; i++)printf("%lld\n", Rand());
    
    a = read();
    b = read();
    if (a == b)
    {
        printf("0\n");
        return 0;
    }
    if (a < b) swap(a , b);
    n = a - b;
    m = 0;
    for ( ; n != 1 ; )
    {
        ll tmp = PR(n);
        for ( ; !MR(tmp) ; )tmp = PR(tmp);
        m++;
        pri[m] = tmp;
        k[m] = 0;
        for ( ; n % tmp == 0 ; )
        {
            k[m]++;
            n = n / tmp;
        }
    }

    ans = a * b;
    dfs(1 , 1);
    printf("%lld\n", ans1);

    return 0;
}