SNGPG - Prime Generator The Easiest Question Ever

no tags 

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 (p2 + 1) or/and (p2 + 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
dushyant_bgs: 2016-06-27 19:48:42

Just observe and get 0.00s. :-)

mkfeuhrer: 2016-06-18 22:49:28

took less than 15 min to solve and code !! tutorials -->

akshayvenkat: 2016-05-10 11:51:10

NotUsingPenAndPaper Solution - 0.81s
UsingPenAndPaper Solution- 0.00s

vikash1143: 2016-03-09 06:28:16

python 3 lines..AC in 1st attempt

aditya1997: 2016-02-12 12:08:45

easiest question ever!!!! my 50 th :)

Siddharth Singh: 2015-12-26 06:53:52

Though i got an AC , i'm still confused because if i giv input 0 9 it gives me ans of 4
instead of 5
and still it is AC

Last edit: 2015-12-26 06:54:16
newbie: 2015-11-12 22:37:32

simplest problem ever got ac in 0.00 :D

shravinson: 2015-08-31 20:26:41

Last edit: 2015-08-31 20:37:45
hodobox: 2015-08-31 14:24:47

Time limit way too high, with precomputation it takes 0.04s in C++, and the simplest bruteforce without precomputation takes 1.64 :P

Last edit: 2015-08-31 18:19:11
Vicky: 2015-08-19 16:48:36

very simple just need observation :P


Added by:AvmnuSng
Date:2013-09-08
Time limit:5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Abhimanyu Singh
My Problems