POJ-1318 Word Amalgamation

题目链接:https://vjudge.net/problem/POJ-1318

用C++中的STL 库解决问题很方便

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<string>
using namespace std;
typedef long long ll;
map<string,set<string> > m;
int main()
{
    //freopen("/home/zlwang/C++/t2.txt","r",stdin);
    string s,s0;
    while(cin>>s)
    {
        if(s[0]=='X') break;
        s0=s;
        sort(s.begin(),s.end());
        m[s].insert(s0); //原串进入集合
    }
    while(cin>>s)
    {
        if(s[0]=='X') break;
        sort(s.begin(),s.end());
        if(m[s].empty()) printf("NOT A VALID WORD\n");
        else
        for(set<string>::iterator it=m[s].begin();it!=m[s].end();it++) //按字典序输出,set本身会排好序
        cout<<*it<<endl;
        printf("******\n");
    }
    return 0;
}