Last Digit SumProblem 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
| Author: | pieguy |
| Date Added: | 2-09-2011 |
| Time Limit: | 1 sec |
| Source Limit: | 50000 Bytes |
| Languages: | ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
Fetching successful submissions
pls explain the output of 3rd
@pallavi046: the explanation
sorry !! I got it ...
Is it possible to submit a
Thanks, I have found the
How to check correctness of