HDU4722~Good Numbers（思路）

Good Numbers

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

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   |   We have carefully selected several similar problems for you:   6018  6017  6016  6015  6014 

一个数字，每位加起来的和可以整除10，则这个数是个好数。。。可以看出，每隔10，必然有一个好数

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<queue>
#include<vector>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define LL long long int
using namespace std;
LL solve(LL x)
{
    //x/10*10之前有多少个好数
    LL sum=x/10;
    //不知道怎么描述这个数了，自己理解把。。
    LL first=x/10*10;
    for(LL i=first;i<=x;i++)
    {
        LL m=i,temp=0;
        while(m)
        {
            temp+=(m%10);
            m/=10;
        }
        if((temp%10)==0)
            return sum+1;
    }
    return sum;
}
int main()
{
    LL t,q=0;
    scanf("%lld",&t);
    while(t--)
    {
        LL a,b;
        scanf("%lld%lld",&a,&b);
        a--;
        LL sum1=solve(a);
        if(a<0)sum1=0;
        LL sum2=solve(b);
        printf("Case #%lld: ",++q);
        printf("%lld\n",abs(sum2-sum1));

    }
}