You are my brother （树的深度）

Little A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A wants to know whether Little B is his elder, younger or brother.

Input

There are multiple test cases. 
For each test case, the first line has a single integer, n (n<=1000). The next n lines have two integers a and b (1<=a,b<=2000) each, indicating b is the father of a. One person has exactly one father, of course. Little A is numbered 1 and Little B is numbered 2. 
Proceed to the end of file.

Output

For each test case, if Little B is Little A’s younger, print “You are my younger”. Otherwise, if Little B is Little A’s elder, print “You are my elder”. Otherwise, print “You are my brother”. The output for each test case occupied exactly one line.

Sample Input

5
1 3
2 4
3 5
4 6
5 6
6
1 3
2 4
3 5
4 6
5 7
6 7

Sample Output

You are my elder
You are my brother

题意 一个n，n行，一行俩数 a,b 。b是a的父亲 ，最后求1和2的关系；

就是求树的深度 

#include <iostream>
#include <string.h>
#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
int  last[2005];
void rebegin()
{
    for(int i=0; i<2005; i++)
    {
        last[i]=i;
    }
}
int main()
{
    int n;

    while(~scanf("%d",&n))
    {
        rebegin();
        for(int i=0; i<n; i++)
        {
            int a,b;
            scanf("%d %d",&a,&b);
            last[a]=b;
        }
        int t=1;
        int a1=0,a2=0;
        while(last[t]!=t)
        {
            a1++;
            t=last[t];
        }
        t=2;
        while(last[t]!=t)
        {
            a2++;
                t=last[t];
        }
        if(a1<a2)
            printf("You are my younger\n");
        else if(a1>a2)
            printf("You are my elder\n");
        else
            printf("You are my brother\n");

    }
    return 0;
}