pascal有趣的树源程序答:var a:array[0..2000,0..2000] of longint;i,j,n,x,m,k,p,q,t,ans:longint;val:array[0..10000] of longint;v:array[0..10000] of boolean;ch:char;procedure dfs(x:longint);var i:longint;begin if x=p then exit;v[x]:=true;for i:=1 to a[x,0] do if not v[...