1159. How many 0's?

单点时限: 2.0 sec

内存限制: 256 MB

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.

样例

Input
10 11
100 200
0 500
1234567890 2345678901
0 4294967295
-1 -1
Output
1
22
92
987654304
3825876150

10 人解决,27 人已尝试。

11 份提交通过,共有 49 份提交。

7.3 EMB 奖励。

创建: 15 年,7 月前.

修改: 5 年,3 月前.

最后提交: 1 年,9 月前.

来源: partychen

题目标签