Description Trung is bored with his mathematics homeworks. He takes a piece of chalk and starts writing a sequence of consecutive integers starting with 1 toN(1 < N < 10000) . After that, he counts the number of times each digit (0 to 9) appears in the sequence. For example, withN = 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. InputThe 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 . OutputFor each test case, write sequentially in one line the number of digit 0, 1,...9 separated by a space. Sample Input2 3 13 Sample Output0 1 1 1 0 0 0 0 0 0 1 6 2 2 1 1 1 1 1 1 |
AC代码:
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int a[15];
int t,n;
cin>>t;
while(t--)
{
memset(a,0,sizeof(a));
cin>>n;
for(int i=1;i<=n;i++)
{
int t=i;
while(t)
{
int num=t%10;
a[num]++;
t/=10;
}
}
for(int i=0;i<10;i++)
{
if(i)
cout<<" ";
cout<<a[i];
}
cout<<endl;
}
return 0;
}

本文介绍了一个编程问题:连续整数序列中0到9各数字的出现次数。通过示例解释了问题背景,并提供了一段清晰易懂的C++代码实现。

被折叠的 条评论
为什么被折叠?



