Given a range [L,R] , we need to find the count of total numbers of prime numbers in the the range [L,R].
The first line of the input contains an integer Q, denoting the number of queries. Each of the queries contains two integers L and R.
For each query, print the total numbers of prime in the given range.
Note: Time Limit: 0.6 seconds
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.