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
Author: pieguy
Tester: chmel_tolstiy
Editorial http://discuss.codechef.com/problems/LASTDIG
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, FORT, FS, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, NODEJS, 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

plz xplain any one

speedblack @ 25 Jul 2012 11:59 PM
plz xplain any one example...how it is done ?

suppose A=1 and B=8 than in

abdulrais_41 @ 26 Jul 2012 01:43 AM
suppose A=1 and B=8 than in between A and B and inclusive both A,B find S[N] and than add their D[N]

A=1,2,3,4,5,6,7,B=8 find

abdulrais_41 @ 26 Jul 2012 01:45 AM
A=1,2,3,4,5,6,7,B=8 find S[N] ex: s[1]=1,s[2]=4 so D[1]=1,D[2]=4 than equals to total D=5

how does 28 138 become 495?

codedroid @ 6 Sep 2012 12:50 AM
how does 28 138 become 495?

@anyone can anyone explain

ronny @ 23 Oct 2012 07:31 PM
@anyone can anyone explain the purpose of multiplying the (sumofdigits for b - sumofdigits of a) with 45/10.... is this some concept of number theory or just a constant found while searching for a pattern

1537369 can yu pls email the

betrayermor @ 8 Nov 2012 11:34 AM
1537369 can yu pls email the test case on which my code is not working.i copied the accepted solution and matched the outputs on my system and its matching with all possible inputs that came in my mind .mu email id is mor_rishabh@yahoo.com

@admin what is wrong

imanshuraj @ 15 Jan 2013 02:41 PM
@admin what is wrong here def sum(n): summ=0 while(n): if((n%10)%2==0): summ=summ+2*(n%10) else: summ=summ+(n%10) n=n/10 return summ def lastdig(q): return (q%10) t=int(raw_input()) while(t): fsum=0 x=int(raw_input()) y=int(raw_input()) while(x!=y+1): fsum=fsum+lastdig(sum(x)) x=x+1 print fsum t=t-1

I have no idea why i'm

frankinstein @ 9 Apr 2013 07:29 PM
I have no idea why i'm getting runtime error in submission, Please verify what runtime error its showing... Problem is 2017358. Thanks.

why error (compile )time is

fast @ 9 May 2013 11:27 PM
why error (compile )time is coming even if my code is running on eclipse with correct output

SUCCESSFUL SUBMISSIONS


Fetching successful submissions

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.