POJ 2429 GCD & LCM Inverse（Miller-Rabbin素性测试，Pollard rho质因子分解）

x = lcm/gcd，假设答案为a,b，那么a*b = x且gcd(a,b) = 1，因为均值不等式所以当a越接近sqrt(x)，a+b越小。

x的范围是int64的，所以要用Pollard_rho算法去分解因子。因为a,b互质，所以我们把相同因子一起处理。

最多16个不同的因子：2,3,5,7,11,13,17,19,23,29,31,37,41,43,47, 乘积为 614889782588491410， 乘上下一个质数53会爆int64范围。

所以剩下暴力枚举一下就好。

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<ctime>
//#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

ll mulMod(ll a, ll b, ll m) // a %= m
{
    ll re = ;
    while(b){
        if(b&){
            re = (re+a); if(re >= m) re -= m;
        }
        a <<= ;
        if(a >= m) a -= m;
        b >>= ;
    }
    return re;
}

ll powMod(ll a,ll q,ll m)
{
    ll re = ;
    while(q){
        if(q&){
            re = mulMod(re,a,m);
        }
        a = mulMod(a,a,m);
        q >>= ;
    }
    return re;
}

bool witness(ll a,ll d,int t,ll n)
{
    ll x = powMod(a,d,n), y;
    while(t--){
        y = mulMod(x,x,n);
        if(y ==  && x !=  && x != n-) return true;
        x = y;
    }
    return x != ;
}

bool RabinMiller(ll n,int k = )
{
    if(n == ) return true;
    if(n <  || ((n&)^) ) return false;
    int t = ;
    ll d = n-;
    while((d&)^) { d>>=; t++; }
    while(k--){
        if(witness(rand()%(n-)+,d,t,n)) return false;
    }
    return true;
}

ll gcd(ll a,ll b)
{
    while(b){
        ll t = a%b;
        a = b;
        b = t;
    }
    return a < ? -a: a;
}

ll rho(ll n)
{
    ll x = rand()%(n-) + ;
    ll y = x, d;
    int i = , k = ;
    ll c = +rand()%(n-);
    while(true){
        i++;
        x = (mulMod(x,x,n) + c);
        if(x >= n) x -= n;
        d = gcd(y-x,n);
        if(d !=  && d != n) return d;
        if(y == x) return n;
        if(i == k){
            y = x;
            k <<= ;
        }
    }
}

ll Prms[], stk[];
int tot;

void pollard(ll n)
{
    tot = ;
    int top = ;
    stk[++top] = n;
    while(top){
        n = stk[top--];
        if(RabinMiller(n)){
            Prms[tot++] = n;
        }else{
            ll p = n;
            while(p >= n) p = rho(p);
            stk[++top] = p;
            stk[++top] = n/p;
        }
    }
}

ll mpow(ll a,int q)
{
    ll re = ;
    while(q){
        if(q&) re *= a;
        a *= a;
        q>>=;
    }
    return re;
}

//#define LOCAL
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    ll g,l;
    while(~scanf("%I64d%I64d",&g,&l)){
        if(l == g){
            printf("%I64d %I64d\n",g,l);
            continue;
        }
        ll x = l/g;
        pollard(x);
        sort(Prms,Prms+tot);
        Prms[tot] = -;
        int k = ;
        for(int j = ,i = , cnt = ; i <= tot; i++) {
            if(Prms[i] == Prms[j]) cnt++;
            else {
                Prms[k++] = mpow(Prms[j],cnt);
                cnt = ; j = i;
            }
        }
        ll sqr = floor(sqrt(x)), best = ;
        for(int S = <<(tot = k); --S; ){
            ll cur = ;
            for(int i = ; i < tot; i++){
                if(S>>i&) cur *= Prms[i];
                if(cur > sqr) break;
            }
            if(cur <= sqr && cur > best) best = cur;
        }
        printf("%I64d %I64d\n",g*best,l/best);
    }

    return ;
}