POJ-1330-earest Common Ancestors

题目比较简单，直接上代码

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#define MAX 10001
using namespace std;
int f[MAX];
bool vis[MAX];
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
	int n;
	scanf("%d",&n);
	memset(vis,0,sizeof(vis));
	memset(f,0,sizeof(f));
	for(int i=0;i<n-1;i++)
	{
	    int ita,itb;
	    scanf("%d%d",&ita,&itb);
	    f[itb]=ita;
	}
	int a,b;
	scanf("%d%d",&a,&b);
	while(a)
	{
	    vis[a]=1;
	    a=f[a];
	}
	while(b)
	{
	    if(vis[b])
		break;
	    b=f[b];
	}
	printf("%d\n",b);
    }
    return 0;
}