4389：X mod f(x)

Here is a function f(x):
　　　int f ( int x ) {
　　　    if ( x == 0 ) return 0;
　　　    return f ( x / 10 ) + x % 10;
　　　}

　　　Now, you want to know, in a given interval [A, B] (1 <= A <= B <= 10⁹), how many integer x that mod f(x) equal to 0.

　　　The first line has an integer T (1 <= T <= 50), indicate the number of test cases.
　　　Each test case has two integers A, B.

　　　For each test case, output only one line containing the case number and an integer indicated the number of x.

2
1 10
11 20

Case 1: 10
Case 2: 3

Author	WHU
Recommend	zhuyuanchen520

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 2012 Multi-University Training Contest 9

最后修改于 2020-10-25T23:13:03+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
4000/2000MS(Java/Others)	32768/32768K(Java/Others)