hdu 4727 The Number Off of FFF

Good Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0

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
   
   18).
  
  

 

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.

   
   
  
  

 

各位数相加可以被10整除的个数,或者是这个数除以10,或者这个数除以10 + 1,主要看前几位和最后一位相加能不能在产生一个这样的数。

#include <iostream>


using namespace std;


long long cal(long long a)
{
    if (a < 0)
    {
        return 0;
    }
    
    long long temp = a % 10, sum = 0;
    
    a /= 10;
    
    long long b = a;
    
    while (b)
    {
        sum += b % 10;
        b /= 10;
    }
    
    if (sum % 10 == 0)
    {
        a++;
    }
    else
    {
        sum %= 10;
        if (sum + temp >= 10)
        {
            a++;
        }
    }
    return a;
}




void input()
{
    int t, k = 0;
    long long a, b;
    
    cin >> t;
    
    while (t--)
    {
        cin >> a >> b;
        
        cout << "Case #" << ++k << ": ";
        printf("%I64d\n", cal(b) - cal(a - 1));
    }
}


int main()
{
    input();
    return 0;
}