Codeforces Round #613 (Div. 2) C. Fadi and LCM

题目：http://codeforces.com/contest/1285/problem/C
思路：\(gcd(a,b)=1,a\mid x,b\mid x\)

#include
 
using namespace std;
 
typedef long long ll;
 
const int N=1e5+5;
 
ll x;
 
ll gcd(ll a,ll b)
{
    return b?gcd(b,a%b):a;
}
void cal()
{
    ll a,b;
    for(ll i=(ll)sqrt(x);i;i--)
    {
        if(x%i==0)
        {
            a=i;
            b=x/i;
            if(gcd(a,b)==1)
                break;
        }
    }
    cout<>x;
    cal();
    return 0;
}