ZOJ2562

ZOJ2562
https://vjudge.net/problem/11781/origin
<=n的且因子数最多的那个数
做法：同因子数取最小，dfs更新答案

#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#define inf ~0
#define N 1000010
#define p(a) putchar(a)
#define For(i,a,b) for(unsigned long long i=a;i<=b;++i)

using namespace std;
unsigned long long n,ans,now;
unsigned long long prime[]={,,,,,,,,,,,,,,,};
void in(unsigned long long &x){
    unsigned long long y=;char c=getchar();x=;
    while(c<''||c>''){if(c=='-')y=-;c=getchar();}
    while(c<=''&&c>=''){ x=(x<<)+(x<<)+c-'';c=getchar();}
    x*=y;
}
void o(unsigned long long x){
    if(x<){p('-');x=-x;}
    if(x>)o(x/);
    p(x%+'');
}

void dfs(unsigned long long depth,unsigned long long num,unsigned long long cnt,unsigned long long up){
    if(num>=now&&cnt<=ans)
        return;
    if(ans<cnt){
        ans=cnt;
        now=num;
    }
    if(ans==cnt&&now>num)
        now=num;
    For(i,,up){
        if(num*prime[depth]>n) return;
        dfs(depth+,num*=prime[depth],cnt*(i+),i);
    }
}

int main(){
    while(scanf("%llu",&n)!=EOF){
        ans=;
        now=;
        dfs(,,,);
        o(now);
        p('\n');
    }
    return ;
}