UVA 10815 — Andy's First Dictionary（强大的字符串流）

题目大意：给你一串字符串，包含空格，标点，字母。让你把所有的单词（连续的字母）处理出来，然后按字典序输出。
例如：
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
这个题用到了字符串流，就是stringstream，在读入的时候，读入到字符串中，然后将所有的标点处理成空格，放到字符串流中，然后从字符串流中流入某个变量，就像输入流一样。然后加到set里面，set自动完成排序。

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

string s,buf;

int main(){
    set<string> st;
    while(cin>>s){
        for(int i = 0;i < s.length();i++){
            if (isalpha(s[i])) s[i] = tolower(s[i]);
            else s[i] = ' ';
        }
        stringstream ss(s);
        while(ss>>buf) st.insert(buf);
    }
    for(set<string>::iterator it = st.begin(); it != st.end();++it){
        cout<<*it<<endl;
    }
    return 0;
}