Preparing NOJ

X mod f(x)

2000ms 32768K

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 <= 109), 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

Info

HDU

Provider HDU

Origin 2012 Multi-University Training Contest 9

Code HDU4389

Tags

Submitted 82

Passed 36

AC Rate 43.9%

Date 06/03/2019 16:43:12

Related

Nothing Yet