描述
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
1 #include<stdio.h> 2 #include<string.h> 3 #include<ctype.h> 4 #include<math.h> 5 6 char a[100000]; 7 int b[26]; 8 9 int solve() 10 { 11 int i,len; 12 char *p; 13 while(gets(a)){ 14 len=strlen(a); 15 for(p=a; *p; p++) 16 { 17 if(isalpha(*p)) 18 b[*p-'a']++; 19 } 20 for(i=0; i<26; i++) 21 { 22 printf("%c:%d\n",'a'+i,b[i]); 23 } 24 printf("\n"); 25 memset(b,0,sizeof(b)); 26 memset(a,'\0',sizeof(a)); 27 } 28 } 29 30 int main() 31 { 32 solve(); 33 return 0; 34 }