BZOJ-1053 反素数ant 爆搜

1053: [HAOI2007]反素数ant
Time Limit: 10 Sec Memory Limit: 162 MB
Submit: 2489 Solved: 1390
[Submit][Status][Discuss]

Description
对于任何正整数x，其约数的个数记作g(x)。例如g(1)=1、g(6)=4。
如果某个正整数x满足：g(x)>g(i) 0

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int read()
{
    int x=0,f=1; char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while (ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}
    return x*f;
}
int n,ans=1,num=1;
int prime[15]={1,2,3,5,7,11,13,17,19,23,29,31};
void dfs(int deep,long long now,int nu,int last)
{
    if (deep==12)
        {
            if(now>ans && nu>num) {ans=now;num=nu;}
            if(now<=ans && nu>=num) {ans=now;num=nu;}
            return;
        }
    for (int t=1,i=0; i<=last && now*t<=n; i++,t*=prime[deep])
        dfs(deep+1,now*t,nu*(i+1),i);
}
int main()
{
    n=read();
    dfs(1,1,1,20);
    printf("%d\n",ans);
    return 0;
}