分析:
我们知道每个数在对抗中会出现n-1次,这就可以求出是那两个人,在判断谁赢谁输。可以单向连边,然后搜索一下即可。
代码:
const
maxn=100;
var
a:array [1..maxn] of longint;
h:Array [1..maxn,1..maxn] of boolean;
i,j,n,x,y:longint;
procedure find(s,en:longint);
var i:longint;
begin
if s=en then
begin
if en=y then
writeln(x,' ',y)
else writeln(y,' ',x);
close(input);
close(output);
halt;
end;
for i:=1 to n do
if h[s,i] then find(i,en);
end;
begin
readln(n);
for i:=1 to n*(n-1) div 2-1 do
begin
readln(x,y);
inc(a[x]);
inc(a[y]);
h[x,y]:=true;
end;
for i:=1 to n do
if a[i]<n-1 then begin x:=i; break; end;
for j:=i+1 to n do
if a[j]<n-1 then begin y:=j; break; end;
find(x,y);
find(y,x);
writeln(x,' ',y);
end.