51nod 四级题 汇总

51Nod－1060－最复杂的数

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
const ull INF = ~0ull;
int Num;
ull n,ans;
int p[] = {,,,,,,,,,,,,,,,};

void dfs(int dep, ull tmp, int num, int pre)
{
    if(dep >= ) return ;
    if(tmp > n) return ;
    if(num > Num) {
        Num = num;
        ans = tmp;
    }
    else if(num == Num && tmp < ans)
        ans = tmp;
    for(int i=;i<=pre;i++) {
        if(n/p[dep] < tmp) break;
        dfs(dep+, tmp*=p[dep], num*(i+), i);
    }
}

int main()
{
    int T; scanf("%d", &T);
    while(T--) {
        scanf("%llu", &n);
        ans = INF;
        Num = ;
        dfs(,,,);
        printf("%llu %d\n", ans, Num);
    }
    return ;
}

搜索 + 剪枝