uva 1225 Digit Counting
2017-07-12 22:10
302 查看
原题:
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这些数当中所有数字1到9出现多少次?
解答:
超级简答题,没啥好说的,凑个数
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这些数当中所有数字1到9出现多少次?
#include<bits/stdc++.h> using namespace std; int mark[10]; int t; int main() { ios::sync_with_stdio(false); cin>>t; while(t--) { int n; cin>>n; memset(mark,0,sizeof(mark)); for(int i=1;i<=n;i++) { string s=to_string(i); for(auto x:s) mark[x-'0']++; } for(int i=0;i<10;i++) { if(i==9) cout<<mark[i]<<endl; else cout<<mark[i]<<" "; } } return 0; }
解答:
超级简答题,没啥好说的,凑个数
相关文章推荐
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- [UVa 1225]:Digit Counting
- UVA - 1225 Digit Counting
- UVa 1225 Digit Counting(习题3-3)
- UVa 1225 - Digit Counting
- 3.3 Digit Counting UVA1225
- UVA 1225 Digit Counting
- UVa 1225 Digit Counting
- (uva)1225 Digit Counting
- UVA1225 Digit Counting
- UVA-1225 Digit Counting
- UVa1225 Digit Counting
- uva 1225 Digit Counting
- UVa 1225 Digit Counting(数字统计)
- (UVA)1225 - Digit Counting
- UVa 1225 Digit Counting
- UVA - 1225 Digit Counting
- UVA1225 Digit Counting
- Problem 009——UVa 1225 - Digit Counting