SNGPG  Prime Generator The Easiest Question Ever
Prime number questions are always being favorite to everyone. This question is extension to the problem PRIME GENERATOR. The question is very very simple and easier than that you cannot imagine. You have to count total number of such primes p in the range [a ≥ 0, b > 0] so that (p^{2} + 1) or/and (p^{2} + 2) is/are prime(s).
Input
First line of input is t, (t < 100) total number of test cases. Next t lines contains two integers a and b seperated by space.
a < 50001, b < 100001 and b > a.
Output
In each line print total numbers of such prime numbers.
Example
Input: 2
0 1
4 5 Output: 2
0
[Consider 0 and 1 as prime numbers for this question]
hide comments
aparnajuhi:
20191003 18:32:44
Last edit: 20191003 18:33:13 

mriow:
20190814 12:50:23
Easy to solve intuitively in O(1) for every test case...


wolfie10:
20190519 18:32:20
try implementing functions!!


mag1x_:
20180622 13:45:24
When all you require is pen & paper :) 

rajcoolaryan:
20180620 09:46:59
0.00 AC.. 2 lines of code 

codiesam_007:
20180121 20:36:25
My 50th!! 

dushyant_bgs:
20160627 19:48:42
Just observe and get 0.00s. :) 

mkfeuhrer:
20160618 22:49:28
took less than 15 min to solve and code !! tutorials > 

akshayvenkat:
20160510 11:51:10
NotUsingPenAndPaper Solution  0.81s


vikash1143:
20160309 06:28:16
python 3 lines..AC in 1st attempt 
Added by:  AvmnuSng 
Date:  20130908 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Abhimanyu Singh My Problems 