【白书之路】1225 - Digit Counting 数字统计

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，生成一个字符串1234...N，然后统计其中每个数字(0-9)出现的次数，这里直接暴力就好了，从1-N枚举数字，然后对于每一个数字，统计这些数字出现的次数，最后按照要求的格式输出。

#include <iostream>
#include <stdio.h>
#include <memory.h>
using namespace std;

int digit_count[10];

void stat(int num)//统计
{
    while(num!=0)
    {
        digit_count[num%10]++;//数字分离
        num/=10;
    }
}

void output()//输出
{
    int i;
    for(i=0; i<9; i++)
    {
        printf("%d ",digit_count[i]);
    }
    printf("%d\n",digit_count[i]);
}

int main()
{
    int t,n,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(digit_count,0,sizeof(digit_count));
        for(i=1; i<=n; i++)//分析每一个数字
        {
            stat(i);
        }
        output();
    }
    return 0;
}