HDU 1219 AC Me

http://acm.hdu.edu.cn/showproblem.php?pid=1219

 

AC Me

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

Problem Description

Ignatius is doing his homework now. Theteacher gives him some articles and asks him to tell how many timeseach 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 thenumber of each letter, so do not pay attention to other characters.The length of article is at most 100000. Process to the end offile.

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 howmany times each letter appears. The output format is like"X:N".

Output a blank line after each test case. More details in sampleoutput.

 

Sample Input

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

 

Sample Output

a:1 b:0 c:2d: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:4u: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:1l: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

 

Author

Ignatius.L

 

Source

杭州电子科技大学第三届程序设计大赛

 

Recommend

Ignatius.L

 

分析：简单题。。

代码如下：

#include<stdio.h>
#include<string.h>
char x[100001];
int ans[26];
int count=0;
int main()
{
 int len,i;
   while(gets(x))
    {
   // if(count!=0) printf("\n");
      memset(ans,0,sizeof(ans));
      len=strlen(x);
   for(i=0;i<len;i++)
        {
         if(x[i]>='a'&& x[i]<='z')
           ans[(int)x[i]-'a']++;
        }
   for(i=0;i<26;i++)
      printf("%c:%d\n",i+'a',ans[i]);
 //  count++;
   printf("\n");    
    }
 return 0; 
}