杭电 ACM 1.2.8
来源:互联网 发布:淘宝账号买卖交易平台 编辑:程序博客网 时间:2024/05/22 18:23
AC Me
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2624 Accepted Submission(s): 919Problem 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
Author
Ignatius.L
Source
杭州电子科技大学第三届程序设计大赛
Recommend
Ignatius.L
没什么难的,运用字符和整数之间的转换关系;跑的有点慢,15ms,以后再改进
源代码:
#include<stdio.h>
#include<string.h>
int main(void)
{
char ch;
int flag = 1;
int i;
int a[26] = {0};
while(scanf("%c", &ch) != EOF)
{
if(ch >= 97 && ch <= 122)
a[ch - 97]++;
if(ch == 10)
{
for(i = 0;i < 26;i++)
{
printf("%c:%d\n", i + 97, a[i]);
a[i] = 0;
}
printf("\n");
}
}
return 0;
}
- 杭电 ACM 1.2.8
- 杭电 acm 1.2.8 Vowel Counting
- 杭电 acm steps1.1.2
- 杭电 ACM 1.2.2
- 杭电 ACM 1.2.1
- 杭电 ACM 1.2.4
- 杭电 ACM 1.2.3
- 杭电 ACM 1.2.5
- 杭电 ACM 1.2.6
- 杭电 ACM 1.2.7
- 杭电 ACM 1.3.8
- 杭电acm 1.2.7 GPA
- 杭电ACM ASCII 1.2.7
- 杭电ACM 1.2.4 GPA
- 杭电oj-acm steps-1.2
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电acm 1010
- linux下打印堆栈方法 锦集
- phpcms常用采集 gbk
- POJ 3667 hotel 和 NYOJ 537 hotel 【线段树之区间合并】
- Hibernate支持两种锁机制
- 一个简单的nodeJS实现
- 杭电 ACM 1.2.8
- 南阳理工:水仙花数
- 南阳理工:韩信点兵
- 南阳理工:1的个数
- 南阳理工:成绩转换
- 南阳理工:n-1位数
- 南阳理工:众数问题
- 南阳理工:组合数
- 南阳理工:喷水装置(一)