UVA 10391 Compound Words

http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19793
You are to nd all the two-word compound words in a dictionary. A two-word compound word is a
word in the dictionary that is the concatenation of exactly two other words in the dictionary.
Input
Standard input consists of a number of lowercase words, one per line, in alphabetical order. There will
be no more than 120,000 words.
Output
Your output should contain all the compound words, one per line, in alphabetical order.
Sample Input
a
alien
born
less
lien
never
nevertheless
new
newborn
the
zebra
Sample Output
alien
newborn

题意：
给定一个词典，要求找出其中所有的复合词，即恰好由两个单词连接而成的词

题解
可以用hash，trie
当然也可以用stl的set！
尽情享受stl中set和string强强联手之下的超优美程序吧

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

int main() {
    set<string> s;
    string tmp;
    while (cin >> tmp)
        s.insert(tmp);
    set<string>::iterator it=s.begin();
    for (it; it!=s.end(); it++)
    {
        tmp=*it;
        for (int i=0; i<tmp.length(); i++)
            if (s.count(tmp.substr(0, i)) && s.count(tmp.substr(i, tmp.length()-i))){
                cout<<tmp<<endl;
                break;
            }
    }
    return 0;
}