数数字-Digit Counting,ACM/ICPC Danang 2007,UVa122
2018-01-25 09:10
239 查看
把前n(n≤10000)个整数顺次写在一起:123456789101112…数一数0~9各出现多少次(输出10个整数,分别是0,1,…,9出现的次数)。
#include<iostream> #include<string> using namespace std; int main() { string s;//将数字串当成字符串输入 cin >> s; int a[10];//用来统计数字出现的次数 memset(a, 0, sizeof(a)); for(int i = 0 ; i < s.length();i++) { for(int j = 0 ; j < 10 ; j++) if(s[i] - '0' == j)//将输入的字符转变成数字进行比较 a[j] ++; } for(int i = 0 ; i < 10 ; i++) cout << a[i] << endl; return 0; }
相关文章推荐
- 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 习题3-3 数数字(Digit Counting , ACM/ICPC Danang 2007, UVa1225)
- 数数字(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)
- 算法竞赛入门经典习题3-3数数字(Digit Counting,ACM/IMPC Danang 2007,UVa1225)
- Digit Counting,ACM/ICPC Danang 2007,UVa 1225
- UVa 1225 - Digit Counting - ACM/ICPC Danang 2007 解题报告 - C语言
- UVA 1225 Digit Counting 【ACM/ICPC Danang 2007】
- 数数字 (Digit Counting,ACM/ICPC Danang 2007,UVa 1225)
- 数数字-Digit Counting,ACM/ICPC Danang 2007,UVa1225
- Digit Counting, ACN/ICPC DANANG 2007, UVa1225 数数字
- Digit Counting, ACM/ICPC Danang 2007, UVa 1225
- UVa1225 ACM/ICPC Danang 2007(python reasize)
- 生成元(Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 生成元(Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 最小生成元 (Digit Generator, ACM/ICPC Seoul 2005, UVa1583)
- 例题8-2 联合国大楼(Building for UN, ACM/ICPC NEERC 2007, UVa1605)
- 习题3-2 分子量(Molar Mass, ACM/ICPC Seoul 2007, UVa1586)