hduoj 4722 Good numbers

Problem Description

If we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number.
You are required to count the number of good numbers in the range from A to B, inclusive.

 

Input

The first line has a number T (T <= 10000) , indicating the number of test cases.
Each test case comes with a single line with two numbers A and B (0 <= A <= B <= 10 ¹⁸).

 

Output

For test case X, output "Case #X: " first, then output the number of good numbers in a single line.

 

Sample Input

   
   
   
   

    
    
    
    2
1 10
1 20
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    Case #1: 0
Case #2: 1

    
    
    
    
 
     
 
      Hint 
     
 The answer maybe very large, we recommend you to use long long instead of int. 
    
    
    
    
     
   
   
   
   

 

Source

2013 ACM/ICPC Asia Regional Online —— Warmup2

 

Recommend

zhuyuanchen520

分析： 我写了一个巨复杂无比的算法。。。其实就是 dfs + dp

对每一位进行计数，需要分类讨论 是否与 下界数字接壤，是否与上界数字接壤（分为4种情况）

代码如下：