hdu-oj 1219 AC Me
来源:互联网 发布:淘宝店运营视频教程 编辑:程序博客网 时间:2024/05/01 10:53
AC Me
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11886 Accepted Submission(s): 5297
Problem Description
Ignatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.
It's really easy, isn't it? So come on and AC ME.
It's really easy, isn't it? So come on and AC ME.
Input
Each article consists of just one line, and all the letters are in lowercase. You just have to count the number of each letter, so do not pay attention to other characters. The length of article is at most 100000. Process to the end of file.
Note: the problem has multi-cases, and you may use "while(gets(buf)){...}" to process to the end of file.
Output
Note: the problem has multi-cases, and you may use "while(gets(buf)){...}" to process to the end of file.
Output
For each article, you have to tell how many times each letter appears. The output format is like "X:N".
Output a blank line after each test case. More details in sample output.
Output a blank line after each test case. More details in sample output.
Sample Input
hello, this is my first acm contest!work hard for hdu acm.
Sample Output
a:1b:0c:2d:0e:2f:1g:0h:2i:3j:0k:0l:2m:2n:1o:2p:0q:0r:1s:4t:4u:0v:0w:0x:0y:1z:0a:2b:0c:1d:2e:0f:1g:0h:2i:0j:0k:1l:0m:1n:0o:2p:0q:0r:3s:0t:0u:1v:0w:1x:0y:0z:0附代码:#include <stdio.h>#include <string.h>char buf[100010];int main(){ int aa[26],i,k,m; while(gets(buf)!=NULL) { memset(aa,0,sizeof(aa)); m=strlen(buf); for(i=0;i<m;i++) { k=0; if(buf[i]>='a'&&buf[i]<='z') { while(buf[i]!=char('a'+k)) k++; aa[k]++; } } for(i=0;i<26;i++) printf("%c:%d\n",char('a'+i),aa[i]); printf("\n"); } return 0;}
0 0
- hdu-oj 1219 AC Me
- hdu 1219 AC Me
- hdu 1219 AC Me
- hdu 1219 AC Me
- HDU 1219 AC Me
- hdu 1219 AC Me
- HDU 1219 AC Me
- hdu-1219-AC Me
- HDU 1219AC Me
- HDU 1219 AC Me
- hdu 1219 AC Me
- hdu-1219 AC Me
- HDU 1219 AC Me
- HDU 1219 AC Me
- HDU 1219 AC Me
- 杭电 OJ 1219 AC Me
- 杭电 HDU 1219 java AC Me
- HDU 1219 AC Me(字母统计)
- 资源汇总
- python实现tail -f命令功能
- HDU4941Magical Forest(map)
- hbase scan 类
- 6.2.8 In Action
- hdu-oj 1219 AC Me
- 记录一个程序中的小bug,关于GUI的JTable组件
- Stockbroker Grapevine
- hdu 1051(贪心算法)
- hbase filter类
- Rage(PC) Modding Notes : Console Commands
- 关于热更新的东西
- POJ训练计划2777_Count Color(线段树/成段更新/区间染色)
- IBM MQ 学习(一)