URAL1748. The Most Complex Number

1748

反素数

素数的个数随大小的递增而递减 可以相同

注意各种超啊

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<cmath>
 using namespace std;
 #define INF 1e19
 #define LL unsigned long long
 #define N 32000
 int p[N],f[N],g,po[N];
 LL maxz,tt,pp[N][],n;
 void init()
 {
     int i,j;

     for(i = ; i < N ; i++)
     if(!f[i])
     {
         for(j = i+i ; j < N ; j+=i)
         f[j] = ;
     }
     for(i = ; i < N ; i++)
     if(!f[i])
     p[++g] = i;
     for(i = ; i <= g ; i++)
     {
         pp[p[i]][] = p[i];
         for(j =  ; ; j++)
         {
             double ss = (double)pp[p[i]][j-]*p[i];
             if(ss>INF) break;
             pp[p[i]][j]=ss;
             //cout<<ss<<endl;

         }
         po[i] = j-;
     }
 }
 void dfs(LL s,int k,int o,LL sum)
 {
     int i;
     LL ts =s;
     if(o>) return ;
     if(maxz<sum||(maxz==sum&&tt>s))
     {
         maxz = sum;
         tt = s;
     }
     for(i = ; i <= min(k,po[o]) ; i++)
     {
         if(n/s<pp[p[o]][i]) break;
         s*=pp[p[o]][i];
         dfs(s,i,o+,sum*(LL)(i+));
         s = ts;
     }
 }
 int main()
 {
     int t,i;
     init();
     cin>>t;
     while(t--)
     {
         cin>>n;
         maxz=,tt=;
         for(i = ; i < po[] ; i++)
         {
             LL s = pp[][i];
             if(s>n)
             {
                 if(i>maxz)
                 {
                     maxz = i;
                     tt = pp[][i-];
                 }
                 break;
             }
             dfs(s,i,,i+);
         }
         cout<<tt<<" "<<maxz<<endl;
     }
     return ;
 }