UVA-1225 Digit Counting
来源:互联网 发布:dijkstra算法 c语言 编辑:程序博客网 时间:2024/05/16 14:15
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
分析:制表,依次列出1~10000中每个数n的范围[1,n]内,0~9的个数。
Source:
#include<stdio.h>int a[10000][10];int main(){ int t,n,i,j,k; scanf("%d",&t); for(i=1;i<10000;i++) { for(j=0;j<10;j++) a[i][j]=a[i-1][j]; k=i; while(k) { a[i][k%10]++; k/=10; } } while(t--) { scanf("%d",&n); for(i=0;i<10;i++) { if(i==0) printf("%d",a[n][i]); else printf(" %d",a[n][i]); } printf("\n"); } return 0;}
- UVa 1225 - Digit Counting
- UVa 1225 - Digit Counting
- UVa-1225 - Digit Counting
- UVa 1225 Digit Counting
- UVA - 1225 Digit Counting
- UVA 1225 - Digit Counting
- UVa 1225 - Digit Counting
- UVa-1225Digit Counting
- 【Uva 1225】 Digit Counting
- UVa 1225 - Digit Counting
- UVa 1225 - Digit Counting
- Uva - 1225 - Digit Counting
- Uva 1225 Digit Counting
- UVA 1225 Digit Counting
- UVa 1225 - Digit Counting
- UVa 1225 Digit Counting
- UVa 1225 Digit Counting
- UVA - 1225 Digit Counting
- JavaSE_39th_Map接口
- 略谈矩阵乘法优化递推
- 从逆序对问题展开 归并排序习题归纳
- 用到索引器创建一个集合DEMO
- C++语言— 引用与指针的区别
- UVA-1225 Digit Counting
- java认知盲点(1)
- IO流_数据输入输出流的概述和讲解
- PowerShell常用命令总结
- 线性表-定义和顺序存储结构
- POJ3204——Ikki's Story I
- 1106. Lowest Price in Supply Chain
- horizon创建网络前端代码分析
- 在windows下配置caffe(caffe for windows + vs2013)