hdu4722 Good Numbers(數位dp)
Good Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3529 Accepted Submission(s): 1128
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.
Source 2013 ACM/ICPC Asia Regional Online —— Warmup2
題意:求a到b(並不包括b)之間共有多少個數能被10整除。 分析:基礎題,dp[ i ][ j ]表示長度為 i 的數對10取模的值為 j 。
#include
#include
#include
#include
#include
#include