UVa 1225 / UVALive 3996 Digit Counting 数数字(字符统计)
2015-01-18 19:13
513 查看
Digit Counting
Submit Status
Description
![](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
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.
For each test case, there is one single line containing the number N .
Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
Description
![](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
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按顺序写在一起,统计数字0~9各个数出现的次数。
#include<iostream> #include<string.h> #include<cstdio> using namespace std; int main() { int T,b,c,i,n,j,e,f; scanf("%d",&T); while(T--) { int k[10]={0}; scanf("%d",&n); for(i=1;i<=n;i++) { f=i; j=0; int a[5]={0}; while(f!=0) { a[j++]=f%10; f/=10; } for(int e=0;e<j;e++) k[a[e]]++; } for(i=0;i<10;i++) { if(i==0) printf("%d",k[i]); else printf(" %d",k[i]); } printf("\n"); } return 0; }
相关文章推荐
- UVa 1225 Digit Counting(数字统计)
- 数数字 (Digit Counting, ACM/ICPC Danang 2007, UVa1225)
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 小紫书 习题 3-3(UVA 1225) 数数字(Digit Counting)
- 《算法竞赛入门经典2ndEdition 》习题3-3 数数字(Digit Counting, Uva1225)
- 算法竞赛入门经典习题3-3数数字(Digit Counting,ACM/IMPC Danang 2007,UVa1225)
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 数数字(Digit Counting,ACM/ICPC Danang 2007,UVa1225)
- Uva1225-Digit Counting-数数字
- 【白书之路】1225 - Digit Counting 数字统计
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- UVA 1225 Digit Counting(统计数位出现的次数)
- UVa1225 Digit Counting 数数字
- UVa 1225 - Digit Counting
- Uva - 1225 - Digit Counting
- UVA1225 Digit Counting
- UVa1225——Digit Counting
- UVa 1225 Digit Counting
- Digit Counting,ACM/ICPC Danang 2007,UVa 1225