UVa ---10391 - Compound Words

这道题主要用来练习stl 的 map 以及string的substr

贴上代码

#include <iostream>#include <string>#include <map>using namespace std;map<string, int>aa;string s[150005];int main(){    int cnt=0;    string a ,b;    while (cin>>s[cnt])aa[s[cnt++]]=1;    for (int i=0; i<cnt; i++) {        for (int j=0; j<s[i].size(); j++) {            a = s[i].substr(0,j+1);            if(!aa[a])continue;            b = s[i].substr(j+1);            if(!aa[b])continue;            cout<<s[i]<<endl;            break;        }    }    return 0;}