首页 > 代码库 > AC Me
AC Me
| Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
| Total Submission(s): 4882 Accepted Submission(s): 1698 |
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:1b:0c:2d:0e:2f:1g:0h:2i:3j:0k:0l:2m:2n:1o:2p:0q:0r:1s:4t:4u:0v:0w:0x:0y:1z:0a:2b:0c:1d:2e:0f:1g:0h:2i:0j:0k:1l:0m:1n:0o:2p:0q:0r:3s:0t:0u:1v:0w:1x:0y:0z:0 |
Author Ignatius.L |
Source 杭州电子科技大学第三届程序设计大赛 |
Recommend Ignatius.L 思路：水题 |
1 #include<cstdio> 2 #include<cstring> 3 int cnt[27]; 4 int main(int argc, char *argv[]) 5 { 6 char str[100010]; 7 while(gets(str)) 8 { 9 memset(cnt,0,sizeof(cnt));10 for(int i=0;str[i]!=‘\0‘;i++)11 {12 if(str[i]>=‘a‘&&str[i]<=‘z‘)13 {14 cnt[str[i]-‘a‘]++;15 }16 }17 for(int i=0;i<26;i++)18 {19 printf("%c:%d\n",‘a‘+i,cnt[i]);20 }21 putchar(‘\n‘);22 }23 return 0;24 }
AC Me
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。