Uva 1225 - Digit Counting
来源:互联网 发布:c语言fabs什么意思 编辑:程序博客网 时间:2024/06/09 17:52
1225 - Digit Counting
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中每个数字出现的次数
用桶排法可以很简单解决
#include <cstdio>#include <cstring>int main(){ int n; scanf("%d",&n); while(n--) { int a; int cnt[10]={0}; int x; scanf("%d",&a); int m; for(int i=1; i<=a; i++) { m=i; while(m!=0) { x=m%10; cnt[x]++; m=m/10; } } for(int i=0; i<10; i++) { printf("%d",cnt[i]); if(i!=9)printf(" "); } 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
- JS循环等待检测
- Git自学之路(三)- Git打标签
- Android Volley框架的几种post提交请求方式
- **MYSQL** 系列一
- 大数据基础(五)从零开始安装配置Hadoop 2.7.2+Spark 2.0.0到Ubuntu 16.04
- Uva 1225 - Digit Counting
- 组合数
- RecyclerView替代listview
- GNY 2015 Running Steps
- Java生成验证码(二) 使用Kaptcha组件生成图片验证码
- EventBus 3.0 深入了解
- POJ 2533 Longest Ordered Subsequence
- CodeForces 346A
- 从上到下逐层打印一棵树