Digit counting, Acm/icpc Danang 2007, UVa 1225

Digit Counting

Description

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

12345678910111213

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

Input The input file consists of several data sets. The "a" of the input file contains the number of data sets which is a positive integer and are not bigger than 20. The following lines describe the data sets. For each test case, the there was 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 

Use an array to record the number of times.

#include <stdio.h>
#include <string.h>
int main ()
{
    int t;
    scanf ("%d", &t);
    while (t--)
    {
        int a[10], n, I;
        memset (A, 0, sizeof (a));
        scanf ("%d", &n);
        For (I=1 i<=n; i++)
        {
            if (i<10)
             a[i]++;
            else
            {
                int q=i;
                while (q)
                {
                a[q%10]++;
                Q = Q/10;
                }
            }
        For (i=0 i<9; i++)
            printf ("%d", A[i]);
        printf ("%d\n", a[9]);
    return 0;
}