soj 1608. Digit Counting

Description

Trung is bored with his mathematics homeworks. He takes a piece of chalk and starts writing a sequence of consecutive integers starting with 1 toN (1 < N < 10000) . After that, he counts the number of times each digit (0 to 9) appears in the sequence. For example, withN = 13 , the sequence is:

12345678910111213

In this sequence, 0 appears once, 1 appears 6 times, 2 appears 2 times, 3 appears 3 times, and each digit from 4 to 9 appears once. After playing for a while, Trung gets bored again. He now wants to write a program to do this for him. Your task is to help him with writing this program.

Input

The input file consists of several data sets. The first line of the input file contains the number of data sets which is a positive integer and is not bigger than 20. The following lines describe the data sets.

For each test case, there is one single line containing the number N .

Output

For each test case, write sequentially in one line the number of digit 0, 1,...9 separated by a space.

Sample Input

2 3 13

Sample Output

0 1 1 1 0 0 0 0 0 0 1 6 2 2 1 1 1 1 1 1没想到最后在out那多了个空格WA4次....凌乱了....思路还是暴力吧....论暴力能解决一切不是问题的问题...#include <iostream>using namespace std;int main() {    long int n, a, b, c[10], d;    cin >> n;    while(n--) {        cin >> a;        for (int i = 0; i < 10; i++) c[i] = 0;        for (int i = 1, b = 10; i <= a; i++) {            d = i;            if(i < 10) c[i]++;            else {                while(d != 0) {                    c[d % b]++;                    d /= 10;                }                            }        }        for (int i  = 0; i < 10; i++) {            if(i != 9) cout << c[i] << " ";            else  cout << c[i];        }        cout << "\n";     }    return 0;}