Fadi and LCM

Today, Osama gave Fadi an integer XX, and Fadi was wondering about the minimum possible value of max(a,b)max(a,b) such that LCM(a,b)LCM(a,b) equals XX. Both aa and bb should be positive integers.

LCM(a,b)LCM(a,b) is the smallest positive integer that is divisible by both aa and bb. For example, LCM(6,8)=24LCM(6,8)=24, LCM(4,12)=12LCM(4,12)=12, LCM(2,3)=6LCM(2,3)=6.

Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?

Input
The first and only line contains an integer XX (1≤X≤10121≤X≤1012).

Output
Print two positive integers, aa and bb, such that the value of max(a,b)max(a,b) is minimum possible and LCM(a,b)LCM(a,b) equals XX. If there are several possible such pairs, you can print any.

Examples
Input
2
Output
1 2
Input
6
Output
2 3
Input
4
Output
1 4
Input
1
Output
1 1
题意：给定一个数X，找出两个数a,b。a和b的最小公倍数等于X，并且max(a,b)最小。求出a和b。
思路：首先max(a,b)最小，那肯定是在sqrt(x)附近的时候，是最符合的。并且最小公倍数还要是X。这样就是sqrt(x)的时间复杂度。直接暴力搜索就行了。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

ll x;
ll gcd(ll x,ll y)
{
	if(y==0) return x;
	else return gcd(y,x%y);
}
int main()
{
	scanf("%lld",&x);
	ll y=sqrt(x);
	while(1)
	{
		if(x%y==0)
		{
			ll a=y;
			ll b=x/y;
			if(a*b/gcd(a,b)==x)
			{
				cout<<a<<" "<<b<<endl;
				break;
			}
		}
		y--;
	}
}//99999999999

努力加油a啊，(^o)/~