SPOJ - AMR11E

Arithmancy is Draco Malfoy's favorite subject, but what spoils it for him is that Hermione Granger is in his class, and she is better than him at it. Prime numbers are of mystical importance in Arithmancy, and Lucky Numbers even more so. Lucky Numbers are those positive integers that have at least three distinct prime factors; 30 and 42 are the first two. Malfoy's teacher has given them a positive integer n, and has asked them to find the n-th lucky number. Malfoy would like to beat Hermione at this exercise, so although he is an evil git, please help him, just this once. After all, the know-it-all Hermione does need a lesson.

Input

The first line contains the number of test cases T. Each of the next T lines contains one integer n.

Output

Output T lines, containing the corresponding lucky number for that test case.

Constraints

1 <= T <= 20
1 <= n <= 1000

Example

Sample Input:
2
1
2

Sample Output:
30
42
题意：求第n个三个以上不同的素数相乘的值（从小到大排），但是只要求三个不同的，也就意味着第五个第六个可以是相同的，如果只是暴力打表求三个不同素数的值，那会漏了很多情况，比如第三个应该是2*3*5*2=60.

思路:枚举从30-10000个数，进行分解质因数，如果能分解出三个以上，则将该数字存到另一个数组，一开始想破脑袋都没想出来，后来看了一下数据范围和通过人数，就知道应该是暴力求解，果然没超时！

代码:

 #include<iostream>
 #include<cmath>
 #include<algorithm>
 using namespace std;
 int a[];
 int ss(int n)//分解质因数
 {
     int q,w,e,c=;
     int t=n;
     for(int i=;i<=n;i++)
     {
         if(n%i==)//如果i为因数就+1
         c++;
         while(n%i==)//去掉重复的因数
         {
             n/=i;
         }
         if(n==)
         break;
     }
     if(c>=)//如果质因数大于等于3则说明该数字符合条件
     return ;
     else
     return ;
 }
 int main()
 {
     int m=,c=;
     long long ans[];
     for(int i=;i<=;i++)//应该第一个样例告诉了你开头是30，所以直接从30枚举。
     {
         if(ss(i))
         a[c++]=i;//保存在数组里，方便直接输出。
     }
     int t,n;
     cin>>t;
     while(t--)
     {
         cin>>n;
         cout<<a[n-]<<endl;//因为数从小到大枚举所以直接就可以输出
     }
     return ;
 }