DCEPC505 - Bazinga!
Sheldon is very proud of his intelligence. To test his intelligence Howard designs a puzzle and asks him to solve it. The puzzle consists of special numbers which can be obtained by multiplying exactly two distinct prime numbers. Sheldon has to tell Howard what is the Kth element of this series. Help him.
For Example 6, 10, 14, 15 are theĀ first few membersĀ of this series whereas 4, 9 and 12 are not.
Input
First line specifies T, the number of test cases.
Next T lines each gives 1 number, K
Output
Output 1 line for each test case giving the Kth element of this series.
Constraints
1 <= T <= 1000
1 <= K <= 2000000
Example
Input: 4 2 3 5 7 Output: 10 14 21 26
hide comments
Rishav Goyal:
2014-06-10 23:49:14
i can't beliveve ac after so many tle :D :D: |
|
Mostafa 36a2:
2014-02-13 21:56:13
OverFlow :) |
|
anurag garg:
2014-01-06 20:56:51
took 3 hours to determine the bounds and 1 hour to remove Sigsegv error...finally AC |
|
Sir_Ostara:
2014-01-05 08:01:47
NZEC in Java for Test Case 5..pls hlp :( |
|
napster:
2013-02-22 09:58:54
getting runtime error after running 5 test cases .......my submission id:8761900 |
|
S__L:
2013-01-20 08:34:32
Check for the bounds ! ;)
|
|
Avinash Thummala:
2013-01-05 23:12:07
Nice prob! |
|
Rishi Mukherje:
2012-06-21 12:09:37
please open for all languages. why not python. |
|
data:
2012-06-20 06:23:42
@sandeep use return 0 |
|
sandeep pandey:
2012-05-29 21:29:24
Why NZEC in Java while C++ is passing
|
Added by: | dce coders |
Date: | 2012-04-18 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | Own Problem |