PMO gives two random numbers a & b to the Prime Minister. PM Modi wants to visit all countries between a and b (inclusive) , However due to shortage of time he can’t visit each and every country , So PM Modi decides to visit only those countries,for which country number has two divisors. So your task is to find number of countries Mr. Modi will visit.
Input Format
The first line contains N , no of test cases. The next N lines contain two integers a and b denoting the range of country numbers.
Constraints
a<=1000000 & b<=1000000.
N<=1000
Output Format
Output contains N lines each containing an answer for the test case.
Sample Input
2
1
10
11
20
Sample Output
4
4
Explanation
PM Modi chooses countries with numbers 2,3,5 and 7 for the first testcase.
For the second testcase , he chooses countries with numbers 11,13,17 and 19.
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
while(n>0){
int a = sc.nextInt();
int b = sc.nextInt();
for(int i = a ; i <= b ; i++){
int divisor = 2;
boolean flag = true ;
while(divisor <= a - 1){
if ( a % divisor == 0){
flag = false;
}
divisor = divisor + 1 ;
}
if(flag == true){
flag = false ;
System.out.println(i);
}
}
n--;
}
}
}