RAONE - Ra-One Numbers


In the War between good and evil . Ra-One is on the evil side and G-One on the good side.

Ra-One is fond of destroying cities and its G-one's duty to protect them..

 

Ra-One loves to destroy cities whose Zip Code has special properties. He says he loves to destroy cities which have Ra-One numbers as their ZIp Code.

Any number is Ra-one if the Difference between Sum of digits at even location and Sum of digits at odd location is One (1).. For eg... for 234563 is Ra-One number

digits at odd location are 3,5,3 (unit place is location 1 )

digits at even location are 2,4,6

Diff = (2+4+6)-(3+5+3)=12-11 = 1.

And 123456 is not Ra-One number

diff = (5+3+1) - (2+4+6) = -4

 

G-One knows this about Ra-one and wants to deploy his Army members in those cities. 1 army member will be deployed in each city.

G-one knows the range of ZIP-Codes where Ra-One might attack & needs your help to find out how many army members he needs.

Can you help Him ?

Input

first line will have only one integer 't' number of Zip-Code ranges. it is followed by t lines

each line from 2nd line cotains 2 integer 'from'  and 'to'. these indicate the range of Zip codes where Ra-one might attack .(from and to are included in the range)

Output

A single number for each test case telling how many army members G-One needs to deploy.

each number should be on separate lines

Example

Input:
2
1 10
10 100


 Output:
1
9
explanation:
for 1st test case the only number is 10
for 2nd test case numbers are 10,21,32,43,54,65,76,87,98

NOTE:
t will be less than 100
from and to will be between 0 and 10^8 inclusive

hide comments
cichipi_: 2018-12-10 12:07:57

Stupid problem statement...
10 is Ra-one but 100 is not.....why?
cz , they start index counting in reverse order... ,so for 100, 1 is in 3rd position

playingitmyway: 2018-09-12 22:37:03

AC in one go! Nice digit dp problem :)

Last edit: 2018-09-12 22:37:33
sxie12: 2018-02-12 08:19:45

Be careful. From and to are between 0 and 10^8 inclusive so it can be 0. That caused my WAs.

rajatgupta20: 2018-02-08 09:04:35

wasted time in figuring out from where the indexing starts , poor explanation given !

Akshay Aradhya: 2018-02-04 13:34:17

Just to clarify Difference here is not the absolute difference

Reayz: 2018-01-26 15:41:36

It take a lot of time to understand that index is counting from last digit...:(

vasiljko2001: 2017-11-25 12:02:45

Why 100 is not counted?

pratham_1: 2017-10-18 12:07:54

YEAHHH!!!!! I solved it in java , I deserve some prize;) Strict time limit... spent almost 3-4weeks;)

pratham_1: 2017-09-09 07:34:04

@sucide i used the same approach dp[index][esum-osum][fix] but getting timeout;(

sucide: 2017-06-12 02:53:40

ac in one go ,,, just keep it simple (dp[idx][sume-sumo][fix])


Added by:Devil D
Date:2012-02-21
Time limit:0.101s
Source limit:30000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own