In the question shown below when im using the method to check a number is prime or not I’m getting a TLE. The algo I used was to check every number before the given number for divisibility.
In the question shown below when im using the method to check a number is prime or not I'm getting a TLE. The algo I used was to check every number before the given number for divisibility
Im not able to add images in the doubt
Im not able to add images so please the question name is Prateek loves candy
see the constraint on number of test cases, It’s quite large because for every test case you are going to find the prime numbers upto that number and at last return the last prime number found, this will cause the TLE for big test cases.
- So, to overcome this problem, let’s just store your test cases in an array.
- Then find the maximum number from all of the testcases.
- then, Use SOE(Sieve of Eratosthenes) to find the prime number upto that number and store that an the array.
- After storing, simply loop over every test case that was stored previously in an array.
- Print the value of n from the array storing primes.
That’s how we need not to find the prime number for every test case