My problem says, to print nth prime number
But the problem is Sieve of Eratos. when applied we require upto x/(log x) = 500000, ie roughly x~ 10^7 or 10^8 which big enough and can cross the bound since Sieve can be done in nloglogn
Concep required
hello @rkrishna
500 000th prime number is 7368787 and we can prepare sieve easily under the given time constraint.
