KPRIMES2 - Finding the Kth Prime (Hard)


The problem statement is really simple (the constraints maybe not). There are some queries. You are to give the answers.

Input

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

Q lines with the answer of each query: the Kth prime number.

Example

Input:
8
1
10
100
1000
10000
100000
1000000
10000000

Output:
2
29
541
7919
104729
1299709
15485863
179424673


hide comments
noble_mushtak: 2019-06-23 16:03:50

This problem can be solved using bitset and segmented sieve+wheel factorization, but requires lots of optimization. Memory limit is over 1GB, but if you are reading/writing to more than 100MB, I think you will probably TLE. My solution ran in 1.38s and 11M.

thinkwise: 2017-02-22 10:53:35

Why i am getting run time error. My code runs perfectly in my computer even for the limit also but still i am getting run time.
Can anyone tell me how to fix this, here is my code.....

[Do not post any source code here]

Last edit: 2017-02-22 11:28:40
ASHUTOSH DWIVEDI: 2016-07-16 16:25:52

As expected,getting TLE using segmented sieve is any other algo required

ash_hacker: 2016-03-28 09:32:32

My program takes 2-3 secs for pre-computing, then generates prime for n=50000000 in 32ms, and still they TLE? Can any admin check my submission?
is time 1.3sec for all queries? or per single query?

Also what is the difference between this and TDKPRIME problem, except constraints?

Last edit: 2016-03-28 09:58:06
pika_pika: 2013-12-26 15:00:09

http://primes.utm.edu/nthprime/index.php#nth
for queries of nth prime pi(n) and random primes

triveni: 2012-12-18 06:55:39

Anyone please reply what is the output for
50000000???

Last edit: 2012-12-18 06:56:43
kuszi: 2011-01-28 18:39:12

@James Waldby Corrected

Abel Nieto Rodriguez: 2011-01-28 18:38:50

@James Waldby
It's clearly a typo.

James Waldby: 2011-01-28 18:38:50

The example shows 8 lines of input after the number Q = 9 and similarly 8 lines of output. Is that an error in the example? (Or does it show some condition the program needs to treat?)


Added by:Alfonso2 Peterssen
Date:2010-04-09
Time limit:1.399s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:C C++ 4.3.2 CPP JAVA PAS-GPC PAS-FPC
Resource:Thanks to TDuke