C

Andy, 8, has a dream - he wants to produce hisvery own dictionary. This is not an easy task forhim, as the number of words that he knows is,well, not quite enough. Instead of thinking up allthe words himself, he has a briliant idea. Fromhis bookshelf he would pick one of his favouritestory books, from which he would copy out allthe distinct words. By arranging the words inalphabetical order, he is done! Of course, it isa really time-consuming job, and this is where acomputer program is helpful.You are asked to write a program that listsall the different words in the input text. In thisproblem, a word is defined as a consecutive sequenceof 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.InputThe input file is a text with no more than 5000 lines. An input line has at most 200 characters. Inputis terminated by EOF.OutputYour output should give a list of different words that appears in the input text, one in a line. Thewords should all be in lower case, sorted in alphabetical order. You can be sure that he number ofdistinct words in the text does not exceed 5000.

Sample Input

Adventures in DisneylandTwo blondes were going to Disneyland when they came to a fork in theroad. 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

首先判断单词的情况，并且把字母都变成小写，由于本题按字母的顺序排序，和set的对于字符串的自动排序情况是一样的，所以用set，并且set当中没有重复的单词，也满足题意，所以对于给的文章，我们判断单词的情况，然后把输入到set当中，最后利用迭代器进行输出就可以了。

ac代码：

#include<iostream>   
#include<string>   
#include<set>  
using namespace std;
set<string> a;
int main()
{
string s;
int i, j, k;
char c; s = "";
while ((c = getchar()) != EOF)
{
if (c >= 'A'&&c <= 'Z')
{
c += 32;
s += c;
}
else if (c >= 'a'&&c <= 'z')
{
s += c;
}
else
{
if (s != "")
{
a.insert(s);
}
s = "";
}
}
for (set<string>::iterator it = a.begin(); it != a.end(); ++it)
cout << *it << endl;
a.clear();
return 0;
}