当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3286:How many 0's?

题目描述

A Benedict monk No.16 writes down the decimal representations of all natural numbers between and including m and n, mn. 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, mn. 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

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3286

最后修改于 2020-10-29T06:57:46+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536