关于我们

质量为本、客户为根、勇于拼搏、务实创新

< 返回

hdu1219

发布时间:2022-07-27 13:55:53
欢迎大家报名参加腾讯编程马拉松~

AC Me

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


Problem Description 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.  
Input 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.  
Output 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.  
Sample Input hello, this is my first acm contest! work hard for hdu acm.  
Sample Output 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<iostream>
  2. #include<cstdio>
  3. #include<cstring>
  4. using namespace std;
  5. int main()
  6. {
  7.  
  8.  char str[100001];
  9.  while(gets(str))
  10.  {  
  11.   int i,a[26]={0};
  12.   int len=strlen(str);
  13.   for(i=0;i<len;i++)
  14.   {
  15.    if(str[i]>='a'&&str[i]<='z')
  16.    {
  17.     a[str[i]-'a']++;
  18.    }
  19.   }
  20.   for(i=0;i<26;i++)
  21.   printf("%c:%d ",i+'a',a[i]);
  22.   printf(" ");
  23.  }
  24.  return 0;
  25. }

/template/Home/DawnNew/PC/Static

立即注册风纳云账号,免费体验多款产品

立即注册