How Many Zeroes?

Medium

LOJ-1140

Jimmy writes down the decimal representations of all natural numbers between and including m and n, (m ≤ n). How many zeroes will he write down?

Input

Input starts with an integer T (≤ 11000), denoting the number of test cases.

Each case contains two unsigned 32-bit integers m and n, (m ≤ n).

Output

For each case, print the case number and the number of zeroes written down by Jimmy.

Sample

Sample Input	Sample Output
Click to copy 5 10 11 100 200 0 500 1234567890 2345678901 0 4294967295	Click to copy Case 1: 1 Case 2: 22 Case 3: 92 Case 4: 987654304 Case 5: 3825876150

xxxxxxxxxx
 
#include <bits/stdc++.h>
using namespace std;
​
// Reads two integers and prints their sum
void basicIO() {
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
}
​
int main() {
    // basicIO();
    // Your cpp code here
    return 0;
}
​

Input

Output

Sample

Total Submissions

Users Tried

Users Solved