【水题】hdoj1219 AC me

又是一道题水我更水敢问谁最水的题

一个我过了很多遍愣是不看题意人家用gets我偏要用getline和stringstream装13的题

用getline和stringstream不知道怎么回事数据一直叠加。也是服气

果然gets一遍AC

不说了特写一篇对自己不看题昏昏沉沉一个劲乱写表示服气

【题目】

AC Me

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

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
  
  

【code】

#include<iostream>
#include<stdio.h>
#include<ctype.h>
using namespace std;
int b[26];
char s[100010];
int main() {
	while (gets_s(s)) {
		memset(b, 0, sizeof(b));
		int len = strlen(s);
		for (int i = 0; i < len; i++)
			if (isalpha(s[i]))b[(int)(s[i] - 'a')]++;
		for (int i = 0; i < 26; i++)
			cout << char('a' + i) << ":" << b[i] << endl;
		cout << endl;
	}
	return 0;
}

结论：

gets挺好用。

我是个智障