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.
First line specifies T, the number of test cases.
Next T lines each gives 1 number, K
Output 1 line for each test case giving the Kth element of this series.
1 <= T <= 1000
1 <= K <= 2000000
Input: 4 2 3 5 7 Output: 10 14 21 26
took 3 hours to determine the bounds and 1 hour to remove Sigsegv error...finally AC
NZEC in Java for Test Case 5..pls hlp :(
getting runtime error after running 5 test cases .......my submission id:8761900
Check for the bounds ! ;)
please open for all languages. why not python.
@sandeep use return 0
Why NZEC in Java while C++ is passing
Please open to all languages. Why those restrictions ? I would like to submit in Python.
|Added by:||dce coders|
|Cluster:||Cube (Intel G860)|
|Languages:||ASM32-GCC MAWK BC C-CLANG C C++ 4.3.2 CPP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JAVA JS-MONKEY KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET|