求含有n个因子的最小正整数(n<=1000000)

 1 #include<cstdio>
 2 #include<cstdlib>
 3 #include<cstring>
 4 #include<algorithm>
 5 using namespace std;
 6     
 7 const int maxn=1e6+5;
 8 int t,n;
 9 int min_num[maxn],cnt[maxn];
10 int main(){
11     memset(min_num,-1,sizeof(min_num));
12     for(int i=1;i<maxn;i++)
13         for(int j=i;j<maxn;j+=i)
14             cnt[j]++;
15     for(int i=1;i<maxn;i++)
16         if(min_num[cnt[i]]==-1)
17             min_num[cnt[i]]=i;
18     scanf("%d",&t);
19     while(t--){
20         scanf("%d",&n);
21         printf("%d\n",min_num[n]);
22     }
23     return 0;
24 }