no tags 

Problem Statement:

Let f(x) be the product of digits of a number.

Given L and R, find the number of values of 'i' such that L <= i <= R and f(i) is even.



The first line consists of an integer t, the number of test cases. For each test case, you are given the two integers L and R.


For each test case, print the number of values of 'i' such that L <= i <= R and f(i) is even.


Input Constraints:

1 <= t <= 100

1   <=  L   <=  R   <=  1000000000


Sample Input:



2 12

4 23


Sample Output:




hide comments
mithun_rahman: 2019-07-11 18:37:59

it can be tagged as [spoiler]

Last edit: 2019-09-30 14:48:31
jarvis_1997: 2017-05-25 12:09:10

I used cout.precision and I got AC otherwise, I was getting WA.

kshubham02: 2017-03-27 11:01:42

Barely 40 lines of code but took more than 1.5 hrs and two submissions

NEXES: 2015-08-04 22:37:23


Sudharsansai: 2015-01-04 20:28:09

Wow...Once again a nice problem from cegprakash...
Reply : The credit for this problem goes to rkarthikeyan

Last edit: 2015-08-10 21:11:11
Naman Goyal: 2014-07-16 20:05:01

Can someone please take a look at submission id 11960363. I have checked it with all the test cases available here in comments and description still getting WA. I have even checked it with brute force, cant find the test case for which it is getting failed. I really appreciate any help.

Never mind, got AC.

Last edit: 2014-07-19 17:25:58
paras meena: 2014-06-30 21:30:36

@Aradhya Thnx Sir For hint 3:)

Aradhya: 2013-04-14 22:22:54

I used 2-d map :D yeah :)

Nick: 2013-04-14 22:22:54

@shailesh thanks, understood :)

shail: 2013-04-14 22:22:54

@andrias...nopes, it is 12. becoz 21 nd 23 have digits 2, which makes the product even.

Added by:cegprakash
Time limit:2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: BF
Resource:problem setter: rkarthikeyan