【题目描述】
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.
【输入】
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.
【输出】
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.
【样例输入】
hello, this is my first acm contest!
work hard for hdu acm.
【样例输出】
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
【分析】
题不难!题不难!!题不难!!!
看着全是英文,其实意思就是统计一句话的各个小写字母的数量。。。
代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int a[30];
char b[100010];
int n,i;
while(gets(b))
{
memset(a,0,sizeof(a)); /*初始化a的数组*/
n=strlen(b); /*计算这个句子的长度*/
for(i=0;i<n;i++)
{
if(b[i]>='a'&&b[i]<='z')
{
a[b[i]-'a']++; /*统计各个小写字母的数量*/
}
}
for(i=0;i<26;i++)
{
printf("%c:%d\n",'a'+i,a[i]); /*按照输出格式输出*/
}
printf("\n"); /*每一个实例隔一个空格*/
}
return 0;
}
留个赞八!!!