HDU 2094 产生冠军

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 10;
char win[1111][1111], loser[1111][1111], temp[55];

int main()
{
    int T;
    while(~scanf("%d", &T))
    {
        if(T == 0) break;
        for(int i = 1; i <= T; i ++)
        {
            scanf("%s %s", win[i], loser[i]);
        }
        int cnt = 0, ans = 0, flag=1;
        for(int i = 1; i <= T; i ++)
        {
            cnt = 0;
            for(int j = 1; j <= T; j ++)
            {
                if(strcmp (win[i], loser[j])!=0)
                    cnt++;
            }
            if(cnt == T)
            {
                 if(flag == 1)
                {
                    flag = 0;
                    strcpy(temp, win[i]);
                    ans ++;
                }
                else if(strcmp(temp, win[i])!=0)
                      ans ++;
            }
        }
        if(ans == 1)
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}