杭电oj—1219—AC Me

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.

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
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.


Sample Input
hello, this is my first acm contest!
work hard for hdu acm.

 

Sample Output
a:1
b:0
c:2
d:0
e:2
f:1
g:0
h:2
i:3
j:0
k:0
l:2
m:2
n:1
o:2
p:0
q:0
r:1
s:4
t:4
u:0
v:0
w:0
x:0
y:1
z:0


a:2
b:0
c:1
d:2
e:0
f:1
g:0
h:2
i:0
j:0
k:1
l:0
m:1
n:0
o:2
p:0
q:0
r:3
s:0
t:0
u:1
v:0
w:1
x:0
y:0

z:0

题目的意思是给你输入一句英文，让你统计每个字母有多少个。

这是一道简单的数学题，不过就是需要用到gets函数来读入，如果用%s读入就很难了，其它的方面没有任何坑点

代码如下：

#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
using namespace std;
char s[100005];
int jishu[130];
int main()
{
    memset(jishu,0,sizeof(jishu));
    memset(s,0,sizeof(s));
    while(gets(s))
    {
        int l=strlen(s);
        for(int i=0;i<l;i++)
            jishu[s[i]]++;
        for(int i=97;i<=122;i++)
            printf("%c:%d\n",i,jishu[i]);
        printf("\n");
        memset(jishu,0,sizeof(jishu));
        memset(s,0,sizeof(s));
    }
    return 0;
}