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

思路：

    定义一个数组a[20]，用来存从 0 ~ 9 每个数字出现的次数。已经知道要输入 n 个数，用for 循环机可以完成。

接下来每输入一个数进行一次分解，把它的各个位的数字分解开来，累加出现的次数。

注意：要将数组a[20]清零更新！！

# include <stdio.h>
# include <string.h>
int main()
{
    int n, i, m, a[15], x, y;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&m);
        memset(a, 0, sizeof(a));    //对数组a的清零；
        for(i=1; i<=m; i++)
        {
            y=i;
            while(y!=0)
            {
                x=y%10;         //分解输入的每个数字；
                a[x]++;         //将出现的数字保存；
                y=y/10;        
            }
        }
        for(i=0; i<=9; i++)
        {
            if(i==0)
                printf("%d",a[i]);
            else
                printf(" %d",a[i]);
        }
        printf("\n");
    }
    return 0;
}
 
 
 
 
 
挺简单的一道题我想的那么复杂，也是醉了。
本来是用算法写的但突然发现位数问题，，感觉实在麻烦。。
哎，以后脑细胞还是要灵活点~