n的约数

 https://ac.nowcoder.com/acm/contest/907/B

思路：约数个数数目只与素质子分解的指数有关，所以素因子从小取；枚举取得个数，爆炸取得个数递减；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1000000007;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll ans=0;
ll n;
int p[300]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167};
void dfs(int pos,ll num,ll sum,int len)
{
    if(sum>n) return ;
    if(sum<=n) ans=max(ans,num);
    for(int i=1;i<=len;i++)
    {
        ll tot=pow(p[pos],i);
        if(sum>n/tot) break;
        dfs(pos+1,num*(i+1),sum*tot,i);
    }
}

int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    /*for(int i=2;i<=10000;i++)
    {
        bool f=1;
        int k=i;
        for(int j=2;j<=sqrt(k);j++)
        {
            if(k%j==0)
            {
                f=0;
                break;
            }
        }
        if(f) cout<<i<<",";
    }*/
    int t;
    cin>>t;
    while(t--)
    {
        ans=0;
        cin>>n;
        dfs(0,1,1,30);
        cout<<ans<<endl;
    }

    return 0;
}