AMR11E - Distinct Primes
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
hide comments
luc1d_4nc3st0r:
2022-07-05 05:40:46
solved
|
|
saurav_03:
2022-02-10 19:13:56
Hint: prime factorization, and keep track of distinct prime number >=3 |
|
cormackrum:
2021-07-30 01:33:46
Hint: Pre-Compute only upto 2700 numbers!
|
|
sarkardchamp:
2021-04-20 23:56:04
which is the third lucky number?
|
|
ankay_21:
2020-10-18 17:06:36
**Take Care** - 'at least' |
|
deepak_start:
2020-07-10 17:02:38
precompute and print. |
|
vritta:
2020-04-20 18:45:41
If stuck, see <snip>
|
|
sanket17:
2019-07-14 09:54:03
Brute force will work |
|
mr_quan1998:
2019-07-05 19:29:12
"At leash" make me cry T_T
|
|
aj_254:
2019-05-11 13:23:44
precompute and print. |
Added by: | Varun Jalan |
Date: | 2011-12-15 |
Time limit: | 3s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Varun Jalan - ICPC Asia regionals, Amritapuri 2011 |