Best Coder ^beta
VIP | STD Contests
DIY | Web-DIY ^beta

X mod f(x)

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5431 Accepted Submission(s): 1946

Problem Description

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.

Input

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

Output

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

Sample Input

2
1 10
11 20

Sample Output

Case 1: 10
Case 2: 3

Author

WHU

Source

2012 Multi-University Training Contest 9

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-21 17:02:48, Gzip enabled

Administration