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.


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


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


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


Sample Input:

Sample Output:

hide comments
Rezaul H Sagar: 2016-07-30 08:46:43

map<int,int> gives me 2988 is the 1000th lucky number :/

ab_bh: 2016-06-09 23:17:05

how are you all doing 568th lucky number is 2664
...anybody can help?

Last edit: 2016-06-09 23:17:30
mkfeuhrer: 2016-06-03 13:14:17

use sieve().... AC :-)

mohitgupta07: 2016-05-10 21:08:52

sieve...:P :P ac in one go :) :)

hollapr: 2016-05-09 19:24:03

hint is 2*3*5 is 30 and 2*3*2*5 =60 is also lucky number.

I wasted lot of time in following this sequence...
It is simple... don't complicate the life.

hollapr: 2016-05-09 19:19:09

Weird... I thought, this is the answer... But, it seems to be different...

hareesh: 2016-04-08 12:50:03

Brute force C-> AC in 0.00s :D

Just remembr 1000th lucky number is 2664

lt: 2016-03-26 14:43:44

brute force -> C++ -> AC in 0.00s :P

try2catch: 2016-03-23 19:07:01

Today my 100th.
& obviously Ac in 1st go.

rahul_verma: 2016-02-07 20:30:25

yes !!! done it

Added by:Varun Jalan
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