import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int count=0;
for(int i=0; i<N; i++){
int a = sc.nextInt();
if(a<=2){
a=3;
count=1;
}
int b = sc.nextInt();
for(int j=a; j<b; j++ ){
int prime=1;
for(int k=2; k<j; k++){
if(j%k==0){
prime=0 ;
}
}
if(prime==1){
count++;
}
}
System.out.println(count);
}
sc.close();
}
}
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 1000005 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 the number of primes within the range.
Now your approach is correct. Its just that you are calling this for every input. Don’t do that. Just get all prime numbers within the range (pre compute) and then just simple iterate through the prime numbers array to get your answer.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.
my code is running fine till 1 to 10000.after that it shows an error of index .
Please help me have been stuck on this for a long time.