SP6489 KPRIMES2 - Finding the Kth Prime (Hard)
Description
The problem statement is really simple (the constraints maybe not). There are some queries. You are to give the answers.
Input Format
An integer stating the number of queries Q(equal to 100000), and Q lines follow, each containing one integer K between 1 and 50000000 inclusive.
Output Format
Q lines with the answer of each query: the Kth prime number.