UOJ#548.数学

 #include<iostream>
 #include<algorithm>
 #include<cmath>
 #include<cstdio>
 #include<cstring>
 #define ll long long
 using namespace std;
 const int oo=0x3f3f3f3f;

 ll n,nn,ans1=,ans2,sum;
 bool ok,ook;

 ll get(){
     char zy=getchar();
     ll z=,y=;
     while(zy>''||zy<''){
         if(zy=='-') z=-;
         zy=getchar();
     }
     while(zy>=''&&zy<=''){
         y=(y<<)+(y<<)+zy-'';
         zy=getchar();
     }
     return z*y;
 }

 ll Max(ll a,ll b){return a>b?a:b;}

 void find(){
     for(ll i=;i*i<=nn;){
         if(n%i==){
             if(!ok){
                 ok=;
                 ans1*=i;
             }
             sum++;
             n/=i;
             continue;
         }
         ok=;i++;
         ans2=Max(ans2,sum);
         if(sum&&sum<ans2) ook=;
         sum=;
     }
     if(n!=){
         if(ans2>) ook=;
     }
     ans1*=n;
 }

 bool sexy(){
     for(ll i=;i*i<=n;i++){
         if(n%i==) return false;
     }
     printf("%lld 0\n",n);
 }

 int main(){
     n=nn=get();
     if(sexy()) return ;
     find();
     sum=;
     printf("%lld ",ans1);
     for(ll i=;;i++){
         sum*=;
         if(sum>ans2){
             printf("%d\n",i+);
             break;
         }
         else if(sum==ans2){
             printf("%d\n",i+ook);
             break;
         }
     }
     return ;
 }