算法竞赛入门经典第三章3-3 Digit Counting UVA - 1225
2018-01-03 13:39
399 查看
3-3习题
https://vjudge.net/problem/UVA-1225
https://vjudge.net/problem/UVA-1225
#include<iostream> using namespace std; int main() { int n; cin >> n; while (n--) { int AA[10] = {}; int k; scanf("%d", &k); for (int i = 1; i <= k; ++i) { int j = i; while (j) { ++AA[j % 10]; j /= 10; } } printf("%d", AA[0]); for (int i = 1; i < 10; ++i) printf(" %d", AA[i]); printf("\n"); } }
相关文章推荐
- 算法竞赛入门经典习题3-3数数字(Digit Counting,ACM/IMPC Danang 2007,UVa1225)
- Uva - 1225 - Digit Counting
- 【Uva 1225】 Digit Counting
- 习题3-3 UVa1225 Digit Counting
- UVa 1225(Digit Counting)
- UVa 1225 - Digit Counting
- Digit Counting (P57)/ UVA - 1225
- Uva - 1225 - Digit Counting
- uva 1225 - Digit Counting
- UVa - 1225 - Digit Counting(打表计算)
- UVa 1225 Digit Counting
- UVA1225 Digit Counting
- UVA-1225 Digit Counting
- UVa 1225 Digit Counting
- uva 1225 Digit Counting
- 【习题 3-3 UVA-1225】Digit Counting
- 【习题3-3】 UVA - 1225 Digit Counting
- UVa 1225 Digit Counting
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- UVa 1225 - Digit Counting