uva 148

這題有點奇怪，陣列開得剛剛好 結果RE了

但是限制不是只有20個字嗎，還是我搞錯題意了...

//============================================================================
// Name        : Anagram checker.cpp
// Date : 2013/3/28 上午10:46:49
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <sstream>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 10011
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
struct word{
    int alpha[130];
    char dir[101];

}wtmp,phrase;
vector<word> dire;
set<string> set1,set2;
word ans[2005];
void dfs(int depth,int now){
    int size=dire.size();
    bool judge=true;
    for(int i=0;i<26;i++){
        if(phrase.alpha[i]!=0){
            judge=false;
            break;
        }
    }
    if(judge){
        bool rep=true;
        for(int i=0;i<depth;i++){
            string str(ans[i].dir);
            if(!set1.count(str)){
                rep=false;
            }
        }
        if(rep)return;
        printf("%s =",phrase.dir);
        for(int i=0;i<depth;i++){
            printf(" %s",ans[i].dir);
        }Pln();
        return;
    }
    if(depth==0){
        for(int k=0;k<size;k++){
            word wmp=dire[k];

            bool bigger=true;
            for(int i=0;i<26;i++){
                if(phrase.alpha[i]<wmp.alpha[i]){
                    bigger=false;
                    break;
                }
            }
            if(!bigger)continue;
            for(int i=0;i<26;i++){
                phrase.alpha[i]-=wmp.alpha[i];
            }
            ans[depth]=wmp;
            dfs(depth+1,k);
            for(int i=0;i<26;i++){
                phrase.alpha[i]+=wmp.alpha[i];
            }
        }
    }else{
        for(int k=now;k<size;k++){
            word wmp=dire[k];
            bool bigger=true;
            for(int i=0;i<26;i++){
                if(phrase.alpha[i]<wmp.alpha[i]){
                    bigger=false;
                    break;
                }
            }
            if(!bigger)continue;
            for(int i=0;i<26;i++){
                phrase.alpha[i]-=wmp.alpha[i];
            }
            ans[depth]=wmp;
            dfs(depth+1,k);
            for(int i=0;i<26;i++){
                phrase.alpha[i]+=wmp.alpha[i];
            }
        }
    }
}
int main() {
//    ios_base::sync_with_stdio(0);
    set2.clear();
    while(gets(wtmp.dir)){
        if(wtmp.dir[0]=='#')break;
        if(set2.count(wtmp.dir))continue;
        set2.insert(wtmp.dir);
        int len=strlen(wtmp.dir);
        Set(wtmp.alpha,0);
        for(int i=0;i<len;i++){
            wtmp.alpha[wtmp.dir[i]-'A']++;
        }
        dire.PB(wtmp);
    }
    while(gets(phrase.dir)){
        stringstream ss;
        ss<<phrase.dir;
        set1.clear();
        string inn;
        while(ss>>inn){
            set1.insert(inn);
        }
        if(phrase.dir[0]=='#')break;
        int len=strlen(phrase.dir);
        Set(phrase.alpha,0);
        for(int i=0;i<len;i++){
            if(phrase.dir[i]!=' ')
                phrase.alpha[phrase.dir[i]-'A']++;
        }
        dfs(0,0);
    }


}