ACM 第一天水题 （4）

Problem: You are my brother

Problem Description

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
思考：本题用到了数组类型。首先，先将自己的父亲付成自己，之后再将有父亲的人的tree[ ]付成父亲的值。之后，从1找起并寻找是第几代（sum）的值，直到找到一个人的父亲是其本身的元素这就是他们的其一代。之后比较sum 和ans即可。
代码：
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<iostream>
int a,b,n;
int tree[2017];
int main()
{
    int n,a,b,i;
    while(scanf("%d",&n)!=EOF)
    {
        int sum=0;
        int ans=0;
        memset(tree,0,sizeof(tree));
    for(i=1;i<=n;i++)
        tree[i]=i;
    for(i=1;i<=n;i++)
    {
        scanf("%d %d",&a,&b);
        tree[a]=b;
    }
    int k=1;
    while(tree[k]!=k)
    {
        sum++;
        k=tree[k];
    }
    int q=2;
    while(tree[q]!=q)
    {
        ans++;
        q = tree[q];
    }
    if(sum<ans)
        printf("You are my younger\n");
    if(sum>ans)
        printf("You are my elder\n");
    if(sum==ans)
        printf("You are my brother\n");
    }
    return 0;
}