UVA1225 数数字 Digit Counting——输出格式！输出格式！输出格式！

柔情只为你懂 2022-11-10 14:29 196阅读 0赞

## 这道题我检查了很多遍，但是并没有发现结果的任何错误。但是一直给我WA，最后发现是因为输出格式每一行多出了一个**空格**，为什么它不给我PE！！！？？？ ##

--------------------

# [UVA1225 数数字 Digit Counting][UVA1225 _ Digit Counting] #

### UVa题目[PDF][] ###

### 题目描述 ###

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 ﬁle consists of several data sets. The ﬁrst line of the input ﬁle 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

--------------------

这道题还有一个要点，就是数组不要开太大，也不要消耗过多内存，做一个\[10\]的数组就够了，因为题目的限制是0B

![在这里插入图片描述][20210318223516946.png_pic_center]

正解：

#include <iostream>
    #include <cstdio>
    #include <cstring>
    using namespace std;
    int a[10];
    int main()
    { 
        int t;
        cin >> t;
        int n;
        while (t--)
        { 
            cin >> n;
            memset(a, 0, sizeof(a));
            string str = "";
            for (int x = 1; x <= n; x++)
            { 
                str += to_string(x);
            }
            for (int x = 0; x < str.size(); x++)
            { 
                a[(str[x] - '0')] ++;
            }
            for (int x = 0; x < 9; x++)
                cout << a[x] << " ";
            cout << a[9];
            cout << endl;
        }
        return 0;
    }

[UVA1225 _ Digit Counting]: https://www.luogu.com.cn/problem/UVA1225
[PDF]: https://uva.onlinejudge.org/external/12/p1225.pdf
[20210318223516946.png_pic_center]: /images/20221022/b1ff3b5bea6e4da6a633ae1746c5c645.png