hdoj.1219 AC Me 20140815
来源:互联网 发布:资金合作社软件 编辑:程序博客网 时间:2024/06/03 17:30
AC Me
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11913 Accepted Submission(s): 5310
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.
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<ctype.h>#include<string.h>char s[100010];int main(){ int l,i,p[30]; while(gets(s)) { memset(p,0,sizeof(p)); l=strlen(s); for(i=0;i<l;i++) { if(islower(s[i])) { p[s[i]-'a']++; } } for(i=0;i<=25;i++) { printf("%c:%d\n",i+'a',p[i]); } printf("\n"); } return 0;}
0 0
- hdoj.1219 AC Me 20140815
- HDOJ 1219 AC ME
- hdoj 1219 AC Me
- AC Me hdoj 1219
- HDOJ 1219 AC Me(有问题!)
- hdoj 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
- HUD 1219 AC Me
- HDU 1219 AC Me
- hdu 1219 AC Me
- 1219:AC Me
- tab面板 图片轮换js
- js array属性方法pop() join() reverse() shift() unshift() concat() toString()
- 多个线程同时访问资源
- hdu 1272 小希的迷宫
- 投影矩阵与最小二乘
- hdoj.1219 AC Me 20140815
- js常用表达式
- Python标准库10 多进程初步 (multiprocessing包)
- tomcat的自动加载
- wince6.0下将应用程序放到指定存储设备下运行的方法
- android启动之子系统切换
- Linux程序源码编译安装的configure配置详解
- ExpandableListView讲解
- YUV格式