UVA 1225 Digit Counting
来源:互联网 发布:方正小标宋简体 mac 编辑:程序博客网 时间:2024/05/17 03:33
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 <cstring>#include <cstdio>#include <algorithm>#include <iostream>using namespace std;int main(){ int a[10010][10]={0}; int n; for(int i=1;i<=10000;i++) { a[i][0]=a[i-1][0]; a[i][1]=a[i-1][1]; a[i][2]=a[i-1][2]; a[i][3]=a[i-1][3]; a[i][4]=a[i-1][4]; a[i][5]=a[i-1][5]; a[i][6]=a[i-1][6]; a[i][7]=a[i-1][7]; a[i][8]=a[i-1][8]; a[i][9]=a[i-1][9]; n=i; while(n) { a[i][n%10]++; n/=10; } } int cas; scanf("%d",&cas); while(cas--) { scanf("%d",&n); for(int i=0;i<9;i++) printf("%d ",a[n][i]); printf("%d\n",a[n][9]); } 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
- Hibernate学习——之延迟加载
- IO基础入门之I/O多路复用技术
- 计算机网络--TCP协议中的三次握手和四次挥手(图解)
- 算法——贝叶斯
- BZOJ 2752 [HAOI2012]高速公路(road) 线段树
- UVA 1225 Digit Counting
- [c语言]冒泡排序-------对折判断法
- BLHeli
- hdu 1272 小希的迷宫 (并查集)
- IOS--JSON数据解析成字典
- java之集合Collection详解之2
- hdu 5365+hdu 5355
- 【vector】【bzoj 2083】Intelligence test
- 多路复用/多路分解