GEEKOUNT  EVEN COUNT
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.
Input:
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.
Output:
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
2 12
4 23
Sample Output:
6
12
hide comments
mithun_rahman:
20190711 18:37:59
it can be tagged as combinatorics 

jarvis_1997:
20170525 12:09:10
I used cout.precision and I got AC otherwise, I was getting WA. 

kshubham02:
20170327 11:01:42
Barely 40 lines of code but took more than 1.5 hrs and two submissions 

NEXES:
20150804 22:37:23
Calculations+Implementation!!!!!!!


Sudharsansai:
20150104 20:28:09
Wow...Once again a nice problem from cegprakash...


Naman Goyal:
20140716 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.


paras meena:
20140630 21:30:36
@Aradhya Thnx Sir For hint 3:)


Aradhya:
20130414 22:22:54
I used 2d map :D yeah :) 

Nick:
20130414 22:22:54
@shailesh thanks, understood :) 

shail:
20130414 22:22:54
@andrias...nopes, it is 12. becoz 21 nd 23 have digits 2, which makes the product even. 
Added by:  cegprakash 
Date:  20130115 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: BF 
Resource:  problem setter: rkarthikeyan 