Counting Problem


Submit solution

Points: 1
Time limit: 1.0s
Memory limit: 256M

Problem type
Allowed languages
C++, Python

Digit Count

Given two integers a and b, find the number of occurrences of each digit from 0 to 9 in all the numbers between a and b (inclusive).

For example, if a=1024, b=1032, then there are 9 numbers between them:

1024 1025 1026 1027 1028 1029 1030 1031 1032

Among them, digit 0 appears 10 times, digit 1 appears 10 times, digit 2 appears 7 times, digit 3 appears 3 times, etc.

Input Format

The input contains multiple test cases.

Each test case occupies one line and contains two integers a and b.

When a line with 0 0 is read, it indicates the end of input, and this case should not be processed.

Output Format

For each test case, output one result, occupying one line.

Each result contains ten space-separated numbers: the first number is the count of digit 0, the second number is the count of digit 1, and so on.

Constraints

0 < a, b < 100000000

Sample Input

1 10
44 497
346 542
1199 1748
1496 1403
1004 503
1714 190
1317 854
1976 494
1001 1960
0 0

Sample Output

1 2 1 1 1 1 1 1 1 1
85 185 185 185 190 96 96 96 95 93
40 40 40 93 136 82 40 40 40 40
115 666 215 215 214 205 205 154 105 106
16 113 19 20 114 20 20 19 19 16
107 105 100 101 101 197 200 200 200 200
413 1133 503 503 503 502 502 417 402 412
196 512 186 104 87 93 97 97 142 196
398 1375 398 398 405 499 499 495 488 471
294 1256 296 296 296 296 287 286 286 247

Comments

There are no comments at the moment.