Logical error in code

#1

In the above code, I am failing all the test cases for the given problem and am not able to understand the reason behind it.
As per my understanding the output should be the nth prime number corresponding to input n.

#2

@bluejay,
You are supposed to use the prime seive optimisation technique. Also make sure that you call the primeseive function that you will make before the test cases only to prevent TLE.

Precompute the prime numbers using sieve technique.

In the sieve technique where you create a boolean array of b+1 size.

And start from the first prime number i.e. 2. Take its square(4) and increment it by the number you took (i.e. 4,6,8,10 and so on). Mark all these as false since they cannot be primes.

Now take the next unmarked number, 3. And mark 9,12,15 and so as false. Similarly do it for 4. 16,20,24 and so on as false.

When you finish the loop, count all the positions marked as true and when count is equal to the given test case value print that index. This will be our final answer.

Brute force is something relying on or achieved through the application of force, effort, or power in usually large amounts instead of more efficient methods. Your method is brute force because you are checking for every number instead of using an efficient algorithm

#3

Ok , i understand , thanks for clearing my doubt.