UVa1225 DIgit Counting
2017-04-24 16:56
405 查看
Problem Description
把前n(n<=10000)个整数顺次写在一起:例如12: 123456789101112 数一数0-9各出现多少次
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(n<=10000)个整数顺次写在一起:例如12: 123456789101112 数一数0-9各出现多少次
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
代码:
#include<stdio.h> #include<string.h> char a[10005][100005]; char s[1000000]; int main() { int t, i, n, b[15]; scanf("%d", &t); while(t--) { memset(a, 0, sizeof(a)); memset(s, 0, sizeof(s)); memset(b, 0, sizeof(b)); scanf("%d", &n); for(i = 1; i <= n; i++) { sprintf(a[i - 1], "%d", i);//打印到字符串 } for(i = 0; i < n; i++) { strcat(s, a[i]);//连接成一个串 } for(i = 0; s[i]; i++) { b[s[i] - '0']++;//记录数据 } for(i = 0; i < 9; i++) { printf("%d ", b[i]); } printf("%d\n", b[i]); } return 0; }
相关文章推荐
- UVa 1225 Digit Counting
- 【UVa】[1225]Digit Counting
- UVa-1225 - Digit Counting
- 【习题3-3】 UVA - 1225 Digit Counting
- UVa 1225 Digit Counting
- UVa1225——Digit Counting
- 习题3-3 Digit Counting UVa 1225
- 【习题 3-3 UVA-1225】Digit Counting
- UVA-1225 Digit Counting
- UVA - 1225 Digit Counting
- UVa 1225 - Digit Counting
- UVa 1225 Digit Counting
- 小紫书 习题 3-3(UVA 1225) 数数字(Digit Counting)
- 数数字(Digit Counting,ACM/ICPC Danang 2007,UVa1225)
- UVA Digit Counting UVA - 1225
- UVa1225 Digit Counting
- UVa 1225 Digit Counting (枚举)
- UVa 1225 - Digit Counting
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)