Problem title
Difficulty
Avg time to solve

Game of largest element
Easy
--
Knight Tour
Moderate
25 mins
Find the smallest subset of balls whose weight is greater than the weight of the remaining balls.
Moderate
--
Ninja And A Complex Expression
Moderate
15 mins
Minimum sum of squares of character counts in a given string after removing “k” characters.
Easy
--
Ninja And Chocolates
Moderate
20 mins
Valid Word Abbreviations
Easy
10 mins
NINJA’S BIRTHDAY PARTY
Moderate
30 mins
Three in one
Moderate
15 mins
One Away
Moderate
15 mins

# Prime Digit Sum

Difficulty: HARD
Contributed By
Avg. time to solve
45 min
Success Rate
70%

Problem Statement

#### Output the number of good numbers.

##### Example :
``````Input:
'L' = 15 and 'R' = 19
There is only 1 number between which is good,
16 = 1 + 6 = 7 (which is a prime number).
``````
##### Input Format :
``````The first line of the input contains a single integer 'T', representing the number of test cases.

The first line of each test case contains two integers ‘L’ and ‘R’.
``````
##### Output format :
``````For each test case, output a single integer denoting the number of good numbers between ‘L’ and ‘R’.

Print the output of each test case in a new line.
``````
##### Note :
``````You don’t need to print anything. It has already been taken care of. Just implement the given function. 1 is a co-prime number.
``````
##### Constraints :
``````1 <= ‘T’ <= 10
1 <= ‘L’, ‘R’ <= 10^5

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````2
5 11
1 20
``````
##### Sample Output 1 :
``````3
9
``````
##### Explanation Of Sample Input 1 :
``````For test case 1 we have,

5 , 7 ,
11 = 1+1 = 2
As 2, 5, 7 are prime numbers so 5, 7, 11 are good.

For test case 2 we have,

2, 3, 5, 7,
11 = 1 + 1 = 2
12 = 1 + 2 = 3
14 = 1 + 4 = 5
16 = 1 + 6 = 7
20 = 2 + 0 = 2
As 2, 3, 5, 7 are prime numbers so 2, 3, 5, 7, 11, 12, 14, 16, 20 are good.
``````
##### Sample Input 2 :
``````2
12 16
9 19
``````
##### Sample Output 2 :
``````3
4
``````
Console