CF1285C Fadi and LCM

C. Fadi and LCM

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

我的思路是先把各个互质的因子统计出来比如24有2,2,2,3；就统计成8,3；12有2,2,3,就统计成4,3；先进行质因子分解成互质的数再dp，dp成小于sqrt（n）乘积的最大值，比如3,5,7,8，不超过16的最大乘积是3*5=15；

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<math.h>
#include<bitset>
using namespace std;
#define ll long long
const int mod=258280327;
const int maxn=1e6+10;
ll prime[maxn],a[maxn],dp[maxn],m=0,k=1;
bitset<maxn>v;
void primes(ll n)
{
    for(ll i=2; i<=n; i++)
    {
        if(!v[i])
        {
            prime[++m]=i;
            for(ll j=i+i; j<=n; j=j+i)
                v[j]=true;
        }
    }
}
void solve(ll n)
{
    for(int i=1; i<=m&&prime[i]*prime[i]<=n; i++)
    {
        ll t=1;
        if(n%prime[i]==0)
        {
            while(n%prime[i]==0)
                n=n/prime[i],t=t*prime[i];
            a[k++]=t;
        }
    }
    if(n>1)
        a[k++]=n;
}
int main()
{
    primes(1e6);
    for(int i=1; i<=1e6; i++)
        a[i]=1,dp[i]=1;
    ll n,t=1;
    cin>>n;
    solve(n);
    for(ll i=1;i<k;i++)
    {
        if(a[i]>sqrt(n)) continue;
        for(ll j=sqrt(n);j>=a[i];)
        {
            if(j%a[i]==0) dp[j]=max(dp[j],dp[j/a[i]]*a[i]),t=max(t,dp[j]),j=j-a[i];
            else j=j-j%a[i];
        }
    }
    cout<<t<<' '<<n/t;
}