【算法竞赛入门经典】习题3-3 数数字(Digit Counting,ACM/ICPC Danang 2007,UVa 1225)
2019-07-18 14:45
288 查看
版权声明:本文为博主原创文章,遵循 CC 4.0 by-sa 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/happygirlyao/article/details/96430725
#include<stdio.h> #include<string.h> int a[15]={0}; int main(){ int n; scanf("%d\n",&n); while(n--){ char c; scanf("%c",&c); a[c-'0']++; } for(int i=0;i<10;i++){ if(i<9) printf("%d ",a[i]); else printf("%d\n",a[i]); } return 0; }
相关文章推荐
- 习题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, UVa1225)
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 算法竞赛入门经典-习题3-2 分子量(Molar Mass, ACM/ICPC Seoul 2007, UVa1586)
- 算法竞赛入门经典习题3-3数数字(Digit Counting,ACM/IMPC Danang 2007,UVa1225)
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 数数字-Digit Counting,ACM/ICPC Danang 2007,UVa122
- 【算法竞赛入门经典】习题3-10 盒子(Box,ACM/ICPC NEERC 2004,UVa 1587)
- 数数字 (Digit Counting,ACM/ICPC Danang 2007,UVa 1225)
- 算法竞赛入门经典-习题3-6 纵横字谜的答案(Crossword Answers, ACM/ICPC World Finals 1994,UVa232)
- Digit Counting,ACM/ICPC Danang 2007,UVa 1225
- 算法竞赛入门竞赛 习题3-2 分子量(Molar Mass, ACM/ICPC Seoul 2007, UVa1586)
- 【算法竞赛入门经典】习题3-5 谜题(Puzzle,ACM/ICPC World Finals 1993,UVa 227)
- 【算法竞赛入门经典】习题3-6 谜题(Crossword Answers,ACM/ICPC World Finals 1994,UVa 232)
- 【算法竞赛入门经典】习题3-7 DNA序列(DNA Consensus String,ACM/ICPC Seoul 2006,UVa 1368)
- 算法竞赛入门经典 习题3-1 得分(Score, ACM/ICPC Seoul 2005, UVa1585)
- UVA 1225 Digit Counting 【ACM/ICPC Danang 2007】