UVA-1225 Digit Counting

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

 

题意是：给出一个数N，找出连续书写的前N个正整数中0~9分别的个数。例如N=13，就要找出12345678910111213这一串中各个数字的个数。先for循环打表，再直接在表中查找即可。

代码如下：

#include <cstdio>
#include <iostream>
using namespace std;
int a[10000][10];

int main()
{
    for(int i = 1; i < 10000; i++){
        for(int k = 0; k < 10; k++){  //上一个数中各个数字的个数加至下一行
            a[i][k] = a[i-1][k];
        }
        for(int j = i; j; j /= 10){   //此i中各数字的个数
            a[i][j%10]++;
        }
    }
    int t, n;
    scanf("%d", &t);
    while(t--){
        scanf("%d", &n);
        for(int i=0; i<9; i++){
            printf("%d ", a[n][i]);
        }
        printf("%d\n", a[n][9]);
    }
    return 0;
}