数数字(Digit Counting,ACM/ICPC Danang 2007,UVa1225)
2016-11-11 23:42
423 查看
把前n(n<=10000)个整数顺次写在一起:123456789101112…数一数0~9各出现多少次(输出10个整数,分别是0, 1, …, 9出现的次数)。
#include <cstdio>
#include <cstring>
#define maxn 50000
char buf[maxn];
int main(){
int T;
int a[12];
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
memset(a,0,sizeof(a));
for(int i=1;i<=n;i++){
sprintf(buf,"%d",i);
for(int j=0;buf[j]!='\0';j++) a[buf[j]-'0']++;
}
for(int i=0;i<9;i++) printf("%d ",a[i]);
printf("%d\n",a[9]);
}
return 0;
}
#include <cstdio>
#include <cstring>
#define maxn 50000
char buf[maxn];
int main(){
int T;
int a[12];
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
memset(a,0,sizeof(a));
for(int i=1;i<=n;i++){
sprintf(buf,"%d",i);
for(int j=0;buf[j]!='\0';j++) a[buf[j]-'0']++;
}
for(int i=0;i<9;i++) printf("%d ",a[i]);
printf("%d\n",a[9]);
}
return 0;
}
相关文章推荐
- 数数字 (Digit Counting, ACM/ICPC Danang 2007, UVa1225)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 数数字-Digit Counting,ACM/ICPC Danang 2007,UVa122
- 数数字 (Digit Counting,ACM/ICPC Danang 2007,UVa 1225)
- Digit Counting,ACM/ICPC Danang 2007,UVa 1225
- UVa 1225 - Digit Counting - ACM/ICPC Danang 2007 解题报告 - C语言
- 算法竞赛入门经典习题3-3数数字(Digit Counting,ACM/IMPC Danang 2007,UVa1225)
- UVA 1225 Digit Counting 【ACM/ICPC Danang 2007】
- Digit Counting, ACN/ICPC DANANG 2007, UVa1225 数数字
- 数数字-Digit Counting,ACM/ICPC Danang 2007,UVa1225
- Digit Counting, ACM/ICPC Danang 2007, UVa 1225
- UVa1225 ACM/ICPC Danang 2007(python reasize)
- 小紫书 习题 3-3(UVA 1225) 数数字(Digit Counting)
- UVa1225 Digit Counting 数数字
- UVa 1225 / UVALive 3996 Digit Counting 数数字(字符统计)
- UVa 1225 Digit Counting(数字统计)
- Uva1225-Digit Counting-数数字