Problem B: Andy's First Dictionary |
Time limit: 3 seconds |
Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the words himself, he has a briliant idea. From his bookshelf he would pick one of his favourite story books, from which he would copy out all the distinct words. By arranging the words in alphabetical order, he is done! Of course, it is a really time-consuming job, and this is where a computer program is helpful.
You are asked to write a program that lists all the different words in the input text. In this problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like "Apple", "apple" or "APPLE" must be considered the same.
Input
The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.
Output
Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that he number of distinct words in the text does not exceed 5000.
Sample Input
Adventures in Disneyland Two blondes were going to Disneyland when they came to a fork in the road. The sign read: "Disneyland Left." So they went home.
Sample Output
a adventures blondes came disneyland fork going home in left read road sign so the they to two went were when
题意:按字典序输出所有出现的单词,重复的不算。
思路:首先RE的看下,题目说输出的单词不超过5000个,但是没说加上重复的有多少,我已经试过把数组开到最大还是RE,所以这道题要用vector。另外优化下字母大小写的转换。对比了一下网上其他的代码,感觉我的代码是最短的,也是最容易理解的。【我没有吹牛,真心是这么认为的
AC代码如下:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
char c,s[10010];
vector<string> dis;
int main()
{ int i,pos=0;
while(~(c=getchar()))
{ if(isalpha(c))
s[pos++]=tolower(c);
else if(pos!=0)
{ s[pos]='\0';
dis.push_back(s);
pos=0;
}
}
sort(dis.begin(),dis.end());
for(i=0;i<dis.size();i++)
if(i==0 || dis[i]!=dis[i-1] )
cout<<dis[i]<<endl;
}