bzoj千题计划296：bzoj1053: [HAOI2007]反素数ant

http://www.lydsy.com/JudgeOnline/problem.php?id=1053

求n以内约数个数最多的数

#include<cstdio>

using namespace std;

int n;

int ans;
long long tot;

int prime[]={,,,,,,,,,,};

void dfs(int now,long long sum,long long num)
{
    if(now==) return;
    if(sum>tot || sum==tot && num<ans)
    {
        ans=num;
        tot=sum;
    }
    int cnt=;
    while(num<=n)
    {
        dfs(now+,sum*(cnt+),num);
        num*=prime[now];
        cnt++;
    }
}

int main()
{
    scanf("%d",&n);
    dfs(,,);
    printf("%d",ans);
    return ;
}