【习题3-3】 UVA - 1225 Digit Counting
来源:互联网 发布:人的极限寿命知乎 编辑:程序博客网 时间:2024/06/10 05:35
Description
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
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的范围不大,所以直接枚举即可。。
#include <iostream>#include <algorithm>#include <cstring>using namespace std;int main(){ int n, T, i, temp; int num[20]; cin >> T; while(T--) { cin >> n; memset(num, 0, sizeof(num)); for(i = 1;i <= n;i++) { temp = i; while(temp) { num[temp%10]++; temp /= 10; } } for(i = 0;i < 9;i++) cout << num[i] << ' '; cout << num[i] << endl; } return 0;}
0 0
- 【习题3-3】 UVA - 1225 Digit Counting
- UVa 1225 Digit Counting(习题3-3)
- 小紫书 习题 3-3(UVA 1225) 数数字(Digit Counting)
- 3-3 uva 1225 - Digit Counting
- 习题3-3 数数字(Digit counting)
- 习题3-3 UVa1225 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-1225Digit Counting
- 【Uva 1225】 Digit Counting
- UVa 1225 - Digit Counting
- UVa 1225 - Digit Counting
- Uva - 1225 - Digit Counting
- JavaScript基础-BOM&DOM
- 二叉树的非递归实现
- 根据坐标系统构造转换矩阵(不包含缩放)
- 黑马程序员_Java基础_IO流(File类和properties类相关操作)
- 黑马程序员_IOS内存管理学习总结(三)
- 【习题3-3】 UVA - 1225 Digit Counting
- 黑马程序员_Java基础_多线程1
- 二叉查找树非递归实现
- 查看操作系统位数
- 去除数组中特定字符c(数组法)
- 冒泡排序--oc
- 黑马程序员_Java基础_多线程2
- nyoj 42 一笔画问题
- php编码解码