UVa 10815 Andy's First Dictionary 【set】【字典序】

UVa 10815 安迪上天想要做字典
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
思路：一看不能有重复的，并且按照字母表顺序来，【去重】【排序】正好是set的作用啊。紫书上的代码很简洁，因为用了很多没见过的函数，这几个函数都够拓展的了==

#include <cstdio>
#include <iostream>
#include <set>
#include <cctype>
#include <sstream>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
set<string>dict;
int main()
{
    string str,word;
    while(cin>>str)
    {
        for(int i=0;i<str.length();++i)
        {
            if(isalpha(str[i]))//这里没写出来，因为两个函数之前都没用过orz
                str[i]=tolower(str[i]);
            else str[i]=' ';//又又又把赋值写成等号了摔
        }
        stringstream ss(str);
        while(ss>>word)
        {
            dict.insert(word);
        }//读取每行的word插入到set中
    }
    for(set<string>::iterator it=dict.begin();it!=dict.end();++it)
        cout<<*it<<endl;//迭代器没写出来，格式掌握的不好QAQ
    return 0;
}

ps：在cb上输入后没有结果输出，但是过了……a的我有点怀疑人生