nyoj-282-You are my brother

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
    int n,i,j;
    while(scanf("%d",&n)!=EOF)
    {
        int a=1,b=2,numa=0,numb=0,aa,bb;
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&aa,&bb);
            if(aa==a)
            {
                numa++;
                a=bb;
            }
            if(aa==b)
            {
                numb++;
                b=bb;
            }
        }
        if(numa==numb)
            printf("You are my brother
");
        else if(numa<numb)
            printf("You are my younger
");
        else
            printf("You are my elder
");
    }
    return 0;
}

这题好水 啊      不说明白题意

我的考虑太片面  所以下面粘上全面代码

#include "stdio.h"
typedef struct stu
{
    int a;
    int b;
}S;
int main()
{
    int i,j,n,ansa,ansb,amounta,amountb;
    S old[1005];
    while(scanf("%d",&n)==1)
    {
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&old[i].a,&old[i].b);
            if(old[i].a==1)//到little A；
                ansa=1;
            if(old[i].a==2)//到little B;
                ansb=2;
        }
        amounta=1;
        i=0;
        while(i<n)//计算A是家族中的第几代；
        {
            for(i=0;i<n;i++)
            {
                if(old[i].a==ansa)
                {
                    amounta++;
                    ansa=old[i].b;
                    break;
                }
            }
        }
        amountb=1;
        j=0;
        while(j<n)//计算B是家族中的第几代；
        {
            for(j=0;j<n;j++)
            {
                if(old[j].a==ansb)
                {
                   amountb++;
                   ansb=old[j].b;
                }
            }
        }
        if(amounta>amountb)
            printf("You are my elder
");
        else if(amounta<amountb)
            printf("You are my younger
");
        else
            printf("You are my brother
");
    }
    return 0;
}