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][100],n;
void init()
{
    int i,j;

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

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