uva 10475

不要用select當變數 UVA平台上編譯不會過 T_T

記得轉大寫

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
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 55
#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);
}
int t,p,s;
string topic[M];
map<string,int> sid;
int mz[M][M];
int sel[M];
bool cmp(string a,string b){
    if(a.length()==b.length()){
        return a<b;
    }
    return a.length()>b.length();
}
void init(){
    Set(mz,0);
    sid.clear();
}
void dfs(int index,int n,int dep){
    if(n==s){
        for(int i=0;i<n-1;i++){
            printf("%s ",topic[sel[i]].c_str());
        }
        printf("%s\n",topic[sel[n-1]].c_str());
        return ;
    }
    if(dep==0){
        for(int i=0;i<t;i++){
            sel[n]=i;
//            printf("%s ",topic[i].c_str());
            dfs(i+1,n+1,dep+1);
        }
    }else{
        for(int i=index;i<t;i++){
            bool canput=true;
            for(int j=0;j<n;j++){
                if(mz[sel[j]][i]){
                    canput=false;
                    break;
                }
            }
            if(canput){
                sel[n]=i;
                dfs(i+1,n+1,dep+1);
            }
        }
    }
}
int ff=0;
void solve(){
    printf("Set %d:\n",++ff);
    dfs(0,0,0);
    Pln();
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    while(test--){
        scanf("%d%d%d",&t,&p,&s);
        init();
        char str[100],str2[100];
        for(int i=0;i<t;i++){
            scanf("%s",str);
            int len=strlen(str);
            for(int j=0;j<len;j++){
                str[j]=toupper(str[j]);
            }
            topic[i]=str;
        }
        sort(topic,topic+t,cmp);
        for(int i=0;i<t;i++)sid[topic[i]]=i;
        for(int i=0;i<p;i++){
            scanf("%s%s",str,str2);
            int len=strlen(str);
            for(int j=0;j<len;j++){
                str[j]=toupper(str[j]);
            }
            len=strlen(str2);
            for(int j=0;j<len;j++){
                str2[j]=toupper(str2[j]);
            }
            int x=sid[str],y=sid[str2];
            mz[x][y]=1;
            mz[y][x]=1;
        }
        solve();
    }

















}