GCD - Fadi and LCM - CodeForces - 1285C
題意:
數據範圍:
題解:
代碼:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
ll x;
ll gcd(ll a,ll b)
{
return b ? gcd(b,a%b) : a;
}
int main()
{
cin>>x;
ll a,b,tmp;
for(ll i=sqrt(x);i;i--)
if(x%i==0)
{
tmp=x/i;
if(gcd(i,tmp)==1)
{
a=min(i,tmp);
b=max(i,tmp);
break;
}
}
cout<<a<<' '<<b<<endl;
return 0;
}