bzoj 1053: [HAOI2007]反素数ant 搜索

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<string>
#include<queue>
using namespace std;
#ifdef WIN32
#define LL "%I64d"
#else
#define LL "%lld"
#endif
#define MAXN 11000000
#define MAXV MAXN*2
#define MAXE MAXV*2
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define MAXL 2100000000
typedef long long qword;
inline int nextInt()
{
        char ch;
        int x=0;
        bool flag=false;
        do
                ch=getchar(),flag=(ch==‘-‘)?true:flag;
        while(ch<‘0‘||ch>‘9‘);
        do x=x*10+ch-‘0‘;
        while (ch=getchar(),ch<=‘9‘ && ch>=‘0‘);
        return x*(flag?-1:1);
}

int n,m;
int seq[MAXN],tops=-1;
int prime[30]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51,53,59,61,67,71,73,79,83,89,93,97,101,103,107};
struct aaa
{
        int v,x;
}a[MAXN];
bool cmp_x(aaa a1,aaa a2)
{
        return a1.x<a2.x;
}
int topa=-1;
void search_m(qword now,int l,int tot)
{
        int i;
        int x;
        if (l==30 || now>=MAXL)return ;
//        cout<<now<<" "<<tot<<endl;
        a[++topa].x=now;
        a[topa].v=tot;
        l++;
        x=1;
        for (i=1;i<31 && now<MAXL;i++)
        {
                now*=prime[l];
                x++;
                search_m(now,l,tot*x);
        }
}

int main()
{
        freopen("input.txt","r",stdin);
        //freopen("output.txt","w",stdout);
        int i,j,k;
        int x,y,z;
        int tot;
        int mx=0;
        scanf("%d",&n);
        search_m(1,-1,1);
        sort(a,a+topa+1,cmp_x);
        for (i=1;i<=topa;i++)
        {
                if (a[i].v>mx)
                {
                        mx=a[i].v;
                        if (a[i].x>n)
                        {
                                cout<<x<<endl;
                                return 0;
                        }
                        x=a[i].x;
                }
        }
        return 0;
/*        x=1;
        mx=0;
        for (i=1;i<=n;i++)
        {
                tot=0;
                for (j=1;j<=i;j++)
                {
                        if (i%j==0)tot++;
                }
                if (tot>mx)
                {
                        mx=tot;
                        cout<<i<<" "<<tot<<" "<<endl;
                        x=i;
                }
                
        }
        cout<<endl;*/
        return 0;
}