HDU1219--AC Me

AC Me

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

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

 

解析：感觉这是一道非常基础但是自我感觉非常适合入门的字符串的题目，我是在杭电ACM Steps中进阶的时候做的，感觉不错所以拿来博客，记录一下，与众人分享哈！

#include <iostream>#include <string>#include <string.h>#include <ctype.h>using std::endl;using std::cin;using std::cout;using std::string;int result[26];int main(){#ifdef LOCALfreopen("input.txt" , "r" , stdin);#endifstring str;while(getline(cin , str)){memset(result , 0 , sizeof result);for(int i=0; i<str.length();++i){if(isalpha(str[i])){result[str[i]-'a']++;}}for(int i=0;i<26;++i){cout << (char)('a'+i) << ":" <<result[i] << endl;}cout << endl;}return 0;}