习题3-3 Digit Counting UVa 1225
2018-03-27 10:41
453 查看
题目链接:https://vjudge.net/problem/27516/origin
水题一道,上代码;
ok
水题一道,上代码;
#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> #include <cstring> using namespace std; int T; int a[10]; int main(){ int n,b,c; scanf("%d",&T); while(T--){ memset(a,0,sizeof(a)); scanf("%d",&n); for(int i=1;i<=n;i++){ b=i; while(b!=0){ c=b%10; b/=10; if(c==1){ a[1]++; } if(c==2){ a[2]++; } if(c==3){ a[3]++; } if(c==4){ a[4]++; } if(c==5){ a[5]++; } if(c==6){ a[6]++; } if(c==7){ a[7]++; } if(c==8){ a[8]++; } if(c==9){ a[9]++; } if(c==0){ a[0]++; } } } for(int i=0;i<9;i++){ printf("%d ",a[i]); } printf("%d\n",a[9]); } return 0; }
ok
相关文章推荐
- UVa 1225 Digit Counting(习题3-3)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 【习题 3-3 UVA-1225】Digit Counting
- 《算法竞赛入门经典2ndEdition 》习题3-3 数数字(Digit Counting, Uva1225)
- 【习题3-3】 UVA - 1225 Digit Counting
- 小紫书 习题 3-3(UVA 1225) 数数字(Digit Counting)
- 习题3-3 UVa1225 Digit Counting
- 算法竞赛入门经典习题3-3数数字(Digit Counting,ACM/IMPC Danang 2007,UVa1225)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- Uva - 1225 - Digit Counting
- Digit Counting UVA - 1225
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- UVa-1225 - Digit Counting
- UVa 1225(Digit Counting)
- (UVA)1225 - Digit Counting
- uva 1225 Digit Counting
- 算法竞赛入门经典第三章3-3 Digit Counting UVA - 1225
- UVa1225——Digit Counting
- UVa 1225 Digit Counting
- uva1225 - Digit Counting