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.

  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.

  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.

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.


a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were
when

这个题就是让自己来学会是使用set容器的，解释都是注释里面

#include<algorithm>
#include <iostream>
#include<sstream>
#include<set>
#include<string>
using namespace std;

set<string>dict;

int main()
{
    string s, buf;                                          //存储每一个单词
    while (cin >> s)
    {
        for (int i = 0;i < s.length();i++)
            if (isalpha(s[i]))s[i] = towlower(s[i]);        //判断是否是字母并将字母小写形式重新赋给自己
            else s[i] = ' ';                                //标点符号变为空格
        stringstream ss(s);                                 //将s赋给ss；
        while (ss >> buf)                                   //将ss一个单词一个单词的赋给buf
            dict.insert(buf);                               //将单词插入到set容器里面，set容器会自动排序从小到大
    }
    for (set<string>::iterator it = dict.begin();it != dict.end();++it)     //.begin()返回的是一个迭代器类型，类似于指针
        cout << *it << endl;                                //输出单词
    return 0;
}