UVa-10391 - Compound Words

继续用STL写，虽然比较耗时，但是简洁方便，不容易出错。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
using namespace std;
const int maxx=120010;
vector<string> v;
set<string> ans;
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    string s;
    while(cin>>s) v.push_back(s);
    for(int i=0;i<v.size();i++)
    {
        for(int j=1;j<=v[i].size();j++)
        {
            string t=v[i].substr(0,j);
            if(binary_search(v.begin(),v.end(),t))
            {
                t=v[i].substr(j);
                if(binary_search(v.begin(),v.end(),t))
                    ans.insert(v[i]);
            }
        }
    }
    for(set<string>::iterator it=ans.begin();it!=ans.end();it++)
        cout<<*it<<endl;
}