#include <algorithm>#include <iostream>#include <sstream>#include <string>#include <vector>using namespace std;struct WORD { string str; char Trait[26]; bool operator>=(const WORD &Other) { int i = 0; for (; i < 26 && Trait[i] >= Other.Trait[i]; ++i); return (i == 26); } WORD& operator-=(const WORD &Other) { for (int i = -1; ++i < 26; Trait[i] -= Other.Trait[i]); return *this; } WORD& operator+=(const WORD &Other) { for (int i = -1; ++i < 26; Trait[i] += Other.Trait[i]); return *this; }};void GenTrait(const char *Str, char *Trait) { for (fill(&Trait[0], &Trait[26], 0); *Str != 0; ++Trait[*Str++ - 'A']);}typedef vector<WORD>::const_iterator DICTITER;void SearchAnagram(DICTITER iBeg, DICTITER iEnd, WORD &Phrase) { int nZeroCnt = 0; string &str = Phrase.str; for (; nZeroCnt < 26 && Phrase.Trait[nZeroCnt] == 0; ++nZeroCnt); if (nZeroCnt == 26) { istringstream ss(str); vector<string> SrcWords, GenWords; for (string Word; ss >> Word && Word != "="; SrcWords.push_back(Word)); for (string Word; ss >> Word; GenWords.push_back(Word)); sort(SrcWords.begin(), SrcWords.end()); if (SrcWords != GenWords) { cout << str << endl; } return; } for (DICTITER i = iBeg; i != iEnd; ++i) { if (Phrase >= *i) { Phrase -= *i; str.push_back(' '); str.append(i->str); SearchAnagram(i + 1, iEnd, Phrase); str.erase(str.length() - i->str.length() - 1); Phrase += *i; } }}int main(void) { vector<WORD> Dict, Subset; for (WORD Word; cin >> Word.str && Word.str != "#";) { GenTrait(Word.str.c_str(), Word.Trait); Dict.push_back(Word); } for (string Line; getline(cin, Line) && Line != "#"; Subset.clear()) { WORD Phrase = {Line}; Line.erase(remove(Line.begin(), Line.end(), ' '), Line.end()); if (Line.empty()) { continue; } GenTrait(Line.c_str(), Phrase.Trait); for (vector<WORD>::iterator i = Dict.begin(); i != Dict.end(); ++i) { if (Phrase >= *i) { Subset.push_back(*i); } } Phrase.str.append(" ="); SearchAnagram(Subset.begin(), Subset.end(), Phrase); } return 0;}
