UVA 10391 Compound Words(hash字符串)

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<set>using namespace std;#define rep(i,a,b) for(int i=(a);i<=(b);i++)string s[120000+100];int main(){    ios::sync_with_stdio(0);    set<string> hash;    hash.clear();    int i=0;    while(cin>>s[i])    {        hash.insert(s[i]);        i++;    }    rep(j,0,i-1) rep(k,1,s[j].size()-1){        if(s[j].size()==1) continue;        if(hash.count(s[j].substr(0,k))&&hash.count(s[j].substr(k,s[j].size()))) {cout<<s[j]<<endl;break;}//找到break退出，否则重复输出    }    return 0;}