1214: JUST AC

最新推荐文章于 2025-12-30 18:10:56 发布

原创最新推荐文章于 2025-12-30 18:10:56 发布 · 211 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c语言 #算法

c语言部分acm练习题专栏收录该内容

238 篇文章

订阅专栏

博客围绕统计文章中各字母出现次数的问题展开，给出了输入输出要求，输入为小写字母文章，需统计各字母出现次数并按“X:N”格式输出，还给出样例输入输出，同时展示了相关C语言代码。

1214: JUST AC

1.代码

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

2.代码

#include<stdio.h>
#include<string.h>
int main()
{
    char a[320];
    while(gets(a)!=NULL)
    {
        int b[123]={0},x,i;
        x=strlen(a);
        for(i=0;i<x;i++)
        {
            b[a[i]]++;
        }
        for(i='a';i<='z';i++)
        {
            printf("%c:%d\n",i,b[i]);
        }
        printf("\n");
    }
    return 0;
}