1758: How many 0
内存限制：128 MB
时间限制：10 S
题面：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
A Benedict monk No. 16 writes down the decimal representations of all natural numbers between and including
m and n , m≤ n
. How many 0's will he write down?
Input consists of a sequence of lines. Each line contains two unsigned 32-bit integers m and n, m ≤ n. The last line of input has the value of m negative and this line should not be processed.
For each line of input print one line of output with one integer number giving the number of 0's written down by the monk.
输入样例 复制
10 11
100 200
0 500
1234567890 2345678901
0 4294967295
-1 -1
输出样例 复制
1
22
92
987654304
3825876150