Sicily 1068欢迎提出优化方案

1608. Digit Counting

限制条件

时间限制: 1 秒, 内存限制: 32 兆

题目描述

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 <tex2html_verbatim_mark>(1 < N < 10000) <tex2html_verbatim_mark>. After that, he counts the number of times each digit (0 to 9) appears in the sequence. For example, with N = 13 <tex2html_verbatim_mark>, 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.

输入格式

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 <tex2html_verbatim_mark>.

输出格式

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

样例输入

2
3
13

样例输出

0 1 1 1 0 0 0 0 0 0
1 6 2 2 1 1 1 1 1 1

题目来源

2007 Danang, Vietnam

我都做出来，当然是简单题……

 #include<iostream>
 using namespace std;
 int main()
 {
    int n,N;
    int a[]={}; //store the number of 0 to 9
    cin>>n;
    for(int i=;i<n;i++){
         int a[]={};
         cin>>N;
         for(int j=;j<N+;j++){
               int p=j;
               while(p/ != ){a[p%]++;p=p/;}
                          a[p]++;
           }
    for(int k=;k<;k++) cout<<a[k]<<" ";
    cout<<endl;
      }
    return ;
 }