POJ 1113 Word Amalgamation

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<stack>
#include<vector>
#include<queue>
#include<map>

using namespace std;

vector<string> dict;
multimap<string,string> d;

int main()
{
#ifndef ONLINE_JUDGE
 	freopen("a.in","r",stdin);
#endif
    string word;
    while(cin>>word,word!="XXXXXX")
        dict.push_back(word);
    sort(dict.begin(),dict.end());
    for(vector<string>::iterator it=dict.begin();it!=dict.end();++it){
        string val(*it);
        sort((*it).begin(),(*it).end());
        d.insert(make_pair(*it,val));
    }
    while(cin>>word,word!="XXXXXX"){
        sort(word.begin(),word.end());
        if(d.lower_bound(word)==d.upper_bound(word)){ puts("NOT A VALID WORD"); puts("******"); continue; }
        for(multimap<string,string>::iterator it=d.lower_bound(word);it!=d.upper_bound(word);++it)
            cout<<it->second<<endl;
        cout<<"******"<<endl;
    }
    return 0;
}