hdu1219 AC Me

AC Me

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10167 Accepted Submission(s): 4537


[align=left]Problem Description[/align]
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.

[align=left]Input[/align]
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.

[align=left]Output[/align]
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.

[align=left]Sample Input[/align]

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

[align=left]Sample Output[/align]

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

[align=left]Author[/align]
Ignatius.L

[align=left]Source[/align]
杭州电子科技大学第三届程序设计大赛

# include<stdio.h>
# include<memory.h>
# include<string.h>
int ch[26];
char str[100005];
int main()
{
int i;
while(gets(str))
{
char cc='a';
memset(ch,0,sizeof(ch));
for(i=0; str[i]!='\0'; i++)
if(str[i]>='a' && str[i]<='z')
ch[str[i]-'a']++;//这是我比较赞赏的
for(i=0; i<26; i++)
printf("%c:%d\n",cc++,ch[i]);
printf("\n");
}
return 0;
}

View Code