How many 0's?
ID: 1180
Description
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
Each line contains two unsigned 32-bit integers m and n, m ≤ n.
Output
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.
Sample Test Cases
InputExpected Output
6808 12057
2605
74 3732
1036
Source: 2006 Waterloo Local Contests
Statistics
The Tops
Shortest Submission No (vnu) 0.72 kB GNU C++ view
Most Popular Submission topcoder forum (lviv) 1.00 GNU C++ view