Last Digit Sum

Problem code: LASTDIG

All submissions for this problem are available.

For a non-negative integer N, define S(N) as the sum of the odd digits of N plus twice the sum of the even digits of N. For example, S(5)=5, S(456)=2*4+5+2*6=25, and S(314159)=3+1+2*4+1+5+9=27. Define D(N) as the last digit of S(N). So D(5)=5, D(456)=5, and D(314159)=7. Given 2 non-negative integers A and B, compute the sum of D(N) over all N between A and B, inclusive.

Input

Input will begin with an integer T, the number of test cases. T lines follow, each containing 2 integers A and B.

Output

For each test case, output a single integer indicating the corresponding sum.

Sample Input

3
1 8
28 138
314159 314159

Sample Output

36
495
7

Constraints

T ≤ 1000
0 ≤ A ≤ B ≤ 400,000,000

Date:	2011-09-02
Time limit:	1s
Source limit:	50000B
Languages:	All

Submit

Comments

Loading Comments...

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

Loading Submissions...

RECENT ACTIVITY FOR THIS PROBLEM:

Loading Recent Activity...

HELP

Program should read from standard input and write to standard output.

After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:

Accepted Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
Time Limit Exceeded Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
Wrong Answer Your program compiled and ran succesfully but the output did not match the expected output.
Runtime Error Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
Compilation Error Your code was unable to compile. When you see this icon, click on it for more information.

If you are still having problems, see a sample solution here.