uva 1225 Digit Counting

最新推荐文章于 2023-12-24 00:18:26 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2023-12-24 00:18:26 发布

阅读量389

点赞数

CC 4.0 BY-SA版权

分类专栏：贪心\模拟\STL\暴力文章标签： uva

本文链接：https://blog.youkuaiyun.com/tengfei461807914/article/details/75039860

贪心\模拟\STL\暴力专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一个简单的程序设计问题：计算从1到N的整数序列中每个数字0到9出现的次数。通过使用C++编程语言，文章提供了一个示例程序，该程序能够读取输入的N值，并输出每个数字出现的频率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题：
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，问你从1到n这些数当中所有数字1到9出现多少次？

#include<bits/stdc++.h>
using namespace std;
int mark[10];
int t;
int main()
{
    ios::sync_with_stdio(false);
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        memset(mark,0,sizeof(mark));
        for(int i=1;i<=n;i++)
        {
            string s=to_string(i);
            for(auto x:s)
                mark[x-'0']++;
        }
        for(int i=0;i<10;i++)
        {
            if(i==9)
                cout<<mark[i]<<endl;
            else
                cout<<mark[i]<<" ";
        }
    }
    return 0;
}