s
来源:互联网 发布:c语言算法名称有哪些 编辑:程序博客网 时间:2024/04/28 04:17
program pku1330;
const
maxn=10000;
var
h:array[1..maxn] of boolean;
fa:array[1..maxn] of longint;
caset,xx,now,n,i,u,v,x,y,temp,total:longint;
flag:boolean;
procedure main;
begin
fillchar(h,sizeof(h),0);
fillchar(fa,sizeof(fa),0);
readln(n);
for i:=1 to n-1 do begin
read(x,y);
fa[y]:=x;
end;
readln(u,v);
now:=u;
h[u]:=true;
while fa[now]<>0 do begin
h[fa[now]]:=true;
now:=fa[now];
end;
now:=v;
while now<>0 do
begin
if h[now] then break;
now:=fa[now];
end;
writeln(now);
end;
begin
// assign(input,'pku1330.txt');
// reset(input);
readln(caset);
for xx:=1 to caset do main;
// close(input);
end.
const
maxn=10000;
var
h:array[1..maxn] of boolean;
fa:array[1..maxn] of longint;
caset,xx,now,n,i,u,v,x,y,temp,total:longint;
flag:boolean;
procedure main;
begin
fillchar(h,sizeof(h),0);
fillchar(fa,sizeof(fa),0);
readln(n);
for i:=1 to n-1 do begin
read(x,y);
fa[y]:=x;
end;
readln(u,v);
now:=u;
h[u]:=true;
while fa[now]<>0 do begin
h[fa[now]]:=true;
now:=fa[now];
end;
now:=v;
while now<>0 do
begin
if h[now] then break;
now:=fa[now];
end;
writeln(now);
end;
begin
// assign(input,'pku1330.txt');
// reset(input);
readln(caset);
for xx:=1 to caset do main;
// close(input);
end.