Codeforce 27B Tournament

The tournament «Sleepyhead-2010» in the rapid falling asleep has just
finished in Berland. n best participants from the country have
participated in it. The tournament consists of games, each of them is
a match between two participants. n·(n - 1) / 2 games were played
during the tournament, and each participant had a match with each
other participant.
The rules of the game are quite simple — the participant who falls
asleep first wins. The secretary made a record of each game in the
form «xi yi», where xi and yi are the numbers of participants. The
first number in each pair is a winner (i.e. xi is a winner and yi is a
loser). There is no draws.
Recently researches form the «Institute Of Sleep» have found that
every person is characterized by a value pj — the speed of falling
asleep. The person who has lower speed wins. Every person has its own
value pj, constant during the life.

It is known that all participants of the tournament have distinct
speeds of falling asleep. Also it was found that the secretary made
records about all the games except one. You are to find the result of
the missing game.

Input
The first line contains one integer n (3 ≤ n ≤ 50) — the number
of participants. The following n·(n - 1) / 2 - 1 lines contain the
results of the games. Each game is described in a single line by two
integers xi, yi (1 ≤ xi, yi ≤ n, xi ≠ yi), where xi и yi are the
numbers of the opponents in this game. It is known that during the
tournament each of the n participants played n - 1 games, one game
with each other participant.

Output
Output two integers x and y — the missing record. If there are
several solutions, output any of them.

题目大意：现在有n个人两两之间进行比赛，已知n*(n-1)-1个对赛记录，即丢失了一场比赛记录，输出丢失的记录，如果有多种可能性，输出任意一种。

思路：给定一个无环n阶竞赛图，求缺失一边，水题一个

#include<string.h>
#include<algorithm>
using namespace std;
int main(){
    int n;
    int s[100];//每个点的度数
    int ss[100];//每个点的出度数
    scanf("%d",&n);
    int len=(n*n-n)/2;
    int a,b;
    memset(s,0,sizeof(s));
    memset(ss,0,sizeof(ss));
    for(int i=0;i<len-1;i++){
        scanf("%d%d",&a,&b);
        s[a]++;
        s[b]++;
        ss[a]++;
    }
    a=-1,b=-1;
    for(int i=1;i<=n;i++){
        if(s[i]!=n-1){//选出度数不为n-1的点，即缺失的边的端点
            if(a==-1)a=i;
            else b=i;
        }
    }
    /*
    *若a赢了b 则a的出度大于b
    *若a输了b 则a的出度小于b
    */
    if(ss[a]>=ss[b])printf("%d %d\n",a,b);
    else printf("%d %d\n",b,a);
    return 0;
}