hdu 4722 GoodNumbers

数位DP水题

Good Numbers

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

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.
   
   
  
  

#include <map>
#include <set>
#include <list>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <vector>
#include <cstdio>
#include <cctype>
#include <string>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define PI 3.1415926535897932384626433832795
using namespace std;

long long T, l, r;
long long bit[20], dp[20][10];

long long work(long long n){
	int len = 0;
	memset(dp,0,sizeof(dp));
	while(n){
		bit[++len] = n % 10;
		n /= 10;
	}
	int tmp;
	for(int i = 1; i <= (len / 2); ++i){
		tmp = bit[len-i+1];
		bit[len-i+1] = bit[i];
		bit[i] = tmp;
	}

	int x = 0;
	for(int i = 1; i <= len; ++i){
		for(int j = 0; j <= 9; ++j)  //继承所有有效状态 
			for(int k = 0; k <= 9; ++k)
				dp[i][(j + k) % 10] += dp[i - 1][j];
		  
		for(int j = 0; j < bit[i]; ++j) // 开启所有有效状态，除过上界 
			dp[i][(x + j) % 10]++;
		x = (x + bit[i]) % 10;
	}
	dp[len][x]++;
	return dp[len][0];						
}

int main()
{
	cin >> T;
	for(int i = 1; i <= T; ++i){
		cin >> l >> r;
		cout << "Case #" << i << ": " << work(r) - work(l - 1) << endl;	
	}
	return 0;
}