zoj 2562 More Divisors(反素数)

#include <stdio.h>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <math.h>
#include <string.h>
#include <queue>
#include <string>
#include <stdlib.h>
#include <algorithm>
#define LL long long
#define _LL __int64
#define eps 1e-12
#define PI acos(-1.0)
using namespace std;

LL n;
int prime[20] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59};

LL Maxcur; //当前最大的反素数
int Maxcnt;//最大反素数相应的因子个数

void get_antiprime(LL cur, int cnt, int Maxnum, int k)
{
if(cur > n)
return;
if(cnt > Maxcnt)
{
Maxcnt = cnt;
Maxcur = cur;
}
if(cnt == Maxcnt && cur < Maxcur)
{
Maxcur = cur;
}
LL tmp = cur;
//枚举第K个素数的个数
for(int i = 1; i <= Maxnum; i++)
{
tmp *= prime[k];
if(tmp > n)
return;
get_antiprime(tmp,cnt*(i+1),i,k+1);
}
}

int main()
{
while(~scanf("%lld",&n))
{
Maxcur = 1;
Maxcnt = 1;
get_antiprime(1,1,54,0);
printf("%lld\n",Maxcur);
}
return 0;
}