UVAOJ-Digit counting

本文介绍了一个程序设计问题,即计算从1到N的连续整数序列中每个数字0到9出现的次数。通过解析输入的N值,程序会输出每个数字出现的频次。示例中给出了具体的实现代码及测试样例。
/*
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

*/

#include<stdio.h>
#include<string.h>
int main()
{
	char c;
	int a[10]={},n,m=0,t,i,j;
	char s[10005]={};
	scanf("%d",&t);
	while(t--)
  {
	memset(a,0,sizeof(a));
	j=0;
	int first=1; 
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		sprintf(s,"%d",i); 
		m=0;
		while((c=s[m++])!=0)
		switch(c)
		{
			case'0':++a[0];break;
			case'1':++a[1];break;
			case'2':++a[2];break;
			case'3':++a[3];break;
			case'4':++a[4];break;
			case'5':++a[5];break;
			case'6':++a[6];break;
			case'7':++a[7];break;
			case'8':++a[8];break;
			case'9':++a[9];break;
		}	
		
	}
	while(j<10)
	if(first){printf("%d",a[j++]);first=0;}
	else printf(" %d",a[j++]);
	printf("\n");
  }
  return 0;
}
/*  已经ac。上面用了一个sprintf,把数字直接改成字符输出在字符串中,省了大量笔墨。 
一开始PE了一次,是因为一行中的输出数据之间有空格,但是末尾是回车而不是空格。
用了first就AC了。*/ 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值