MDIGIT3 - Digits Count
English | Vietnamese |
Diana is going to write a list of all positive integers between A and B, inclusive, in base 10 and without any leading zeros. She wants to know how many times each digit is going to be used.
Input
Each test case is given in a single line that contains two integers A and B (1 ≤ A ≤ B ≤ 10^8 ). The last test case is followed by a line containing two zeros.
Output
For each test case output a single line with 10 integers representing the number of times each digit is used when writing all integers between A and B, inclusive, in base 10 and without leading zeros. Write the counter for each digit in increasing order from 0 to 9.
Sample input
1 9
12 321
5987 6123
12345678 12345679
0 0
Output for the sample input
0 1 1 1 1 1 1 1 1 1
61 169 163 83 61 61 61 61 61 61
134 58 28 24 23 36 147 24 27 47
0 2 2 2 2 2 2 2 1 1
hide comments
|
[Trichromatic] XilinX:
2010-11-09 09:50:47
Problem hidden because it's the same as problem MDIGITS. |
|
Dominik Kempa:
2010-11-07 10:23:00
I also get AC in g++ 4.0, TLE in 4.3 |
|
ymGXX:
2010-11-07 06:31:00
use EOF. |
|
numerix:
2010-11-06 22:14:14
There is definitely something wrong with the input! There is at least one line that has not exactly two values, which causes problems using Python. |
|
Ehor Nechiporenko:
2010-11-06 16:36:20
How interesting I have compiled the same solution. But C++ 4.3 gave me TLE, but 4.0 was AC bu 0.07 sec. |
|
Priyank:
2010-11-06 14:39:10
I wonder why my solution is getting WA.I checked on official test cases and it is working fine.
|
|
abhijith reddy d:
2010-11-06 02:23:30
Is there something wrong with the input ?
|
Added by: | psetter |
Date: | 2010-11-04 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | ACM ICPC2010 – Latin American Regional |