uva 11060

拓樸排序之我不會用DFS來做這題

還有機ㄅ的重邊

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         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);
}
map<int,string> rsid;
map<string,int> sid;
int mz[105][105];
int ref[105];
int n,m;
int ff=0;
void init(){
    Set(mz,0);
    Set(ref,0);
    sid.clear();
    rsid.clear();
}
void solve(){
    printf("Case #%d: Dilbert should drink beverages in this order:",++ff);
    for(int i=0;i<n;i++){
        int j;
        for(j=0;j<n;j++)
            if(ref[j]==0)break;
        ref[j]=-1;
        printf(" %s",rsid[j].c_str());
        for(int k=0;k<n;k++){
            if(mz[j][k])ref[k]--;
        }
    }
    printf(".\n\n");
}
int main() {
    ios_base::sync_with_stdio(0);
    while(~scanf("%d",&n)){
        init();
        char str[105],str2[105];
        for(int i=0;i<n;i++){
            scanf("%s",str);
            sid[str]=i;
            rsid[i]=str;
        }
        scanf("%d",&m);
        while(m--){
            scanf("%s%s",str,str2);
            int x=sid[str],y=sid[str2];
            if(!mz[x][y]){
                mz[x][y]=1;
                ref[sid[str2]]++;
            }
        }
        solve();
    }

















}