从杭电OJ1219 到getchar 以及EOF

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
 

Author
Ignatius.L






此题着重判断回车换行和文件结束末尾,通过查阅资料发现,char 类型的变量c,通过赋值语句c=getchar,是不能够获得有关文件结束符EOF的值的。原因在于:EOF的实际值为-1,而char类型是不能被赋值为负数的。所以更加标准的写法应当是:

int c;

c=getchar();

现在只要判断c是否等于-1,就可以判断是否到了文件的末尾了。

更多有关getchar和EOF的内容,参见http://www.jb51.net/article/36848.htm



AC代码

#include <iostream>
#include <stdio.h>
using namespace std;

int main()
{
	//freopen("D:\\input.txt","r",stdin);
	//freopen("D:\\output.txt","w",stdout);
	int A[26]={0};
	int c;
	c=getchar();
	while(c!=-1)
	{
		memset(A,0,sizeof(A));
		while((char)c!='\n'&&c!=-1)
		{
			if(c>='a'&&c<='z')
				A[c-'a']++;
			c=getchar();
		}
		for(int i=0;i<26;i++)
		{
			printf("%c:%d\n",'a'+i,A[i]);
			//cout<<'a'+i<<':'<<A[i]<<endl;
		}
		if(c==-1)
			break;
		cout<<endl;
		c=getchar();
	}
}
			


阅读更多
文章标签: 杭电 ACM
上一篇杭电OJ 1205 WA的产生可能由于数据类型不够大
下一篇杭电OJ 1248 完全背包问题 及反思
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭