1 条题解

  • 0
    @ 2024-12-24 9:54:35

    C :

    #include<stdio.h>
    int main()
    {
    	int ak[3000],i,a,b,n,counter1,counter2;
    	while(scanf("%d",&n)!=EOF)
    	{
    		for(i=0;i<n;i++)
    		{
    			scanf("%d%d",&a,&b);
    			ak[a]=b;
    		}
    		i=1;
    		counter1=counter2=0;
    		while(ak[i])
    		{
    			i=ak[i];
    			counter1++;
    		}
    		i=2;
    		while(ak[i])
    		{
    			i=ak[i];
    			counter2++;
    		}
    		if(counter1<counter2)printf("You are my younger\n");
    		else if(counter2<counter1)printf("You are my elder\n");
    		else printf("You are my brother\n");
    	}
    	return 0;
    }
    

    C++ :

    #include<cstdio>
    #include<map>
    using namespace std;
     
    int main()
    {
    	int n,a,b,na[5000],nb[5000];
    	map<int,int> p;
    	while(scanf("%d",&n)!=EOF)
    	{
    		p.clear();
    		while(n--)
    		{
    			scanf("%d%d",&a,&b);
    			p[a]=b;
    		}
    		int k1=0;
    		na[k1]=p[1];
    		while(p.count(na[k1]))
    		{
    			int t;
    			t=p[na[k1]];
    			k1++;
    			na[k1]=t;
    		}
    		int k2=0;
    		nb[k2]=p[2];
    		while(p.count(nb[k2]))
    		{
    			int t;
    			t=p[nb[k2]];
    			k2++;
    			nb[k2]=t;
    		}
    		int flag=0;
    		for(int i=0;i<=k1;i++)
    		{
    			if(flag)
    				break;
    			for(int j=0;j<=k2;j++)
    				if(na[i]==nb[j])
    				{
    					if(i<j)
    						printf("You are my younger\n");
    					else if(i>j)
    						printf("You are my elder\n");
    					else
    						printf("You are my brother\n");
    					flag=1;
    					break;
    				}
    		}
    	}
    	return 0;
    }
    

    Java :

    
    
    import java.io.BufferedInputStream;
    import java.util.Scanner;
    
    public class Main {
    
    	
    	public static void main(String[] args)
    	{
    		Scanner scanner = new Scanner(new BufferedInputStream(System.in));
    		
    		while(scanner.hasNext())
    		{
    			 int number1 = 0;
    			 int number2 = 0;
    			 int n = scanner.nextInt();
    			 int a[][] = new int[20 + 2][2 + 20];
    			 for(int i = 0; i < n; i++)
    			 {
    				 int x = scanner.nextInt();
    				 int y = scanner.nextInt();
    				 a[x][y] = 1;
    			 }
    			 
    			 boolean a1 = true;
    			 int x1 = 1;
    			 while(a1)
    			 {
    				 for(int i = 1; i <= 20; i++)
    				 {
    					 if(a[x1][i] == 1)
    					 {
    						 x1 = i;
    						 number1++;
    						 a1 = true;
    						 break;
    					 }
    					 else
    					 {
    						 a1 = false;
    					 }
    					
    				 }
    			 }
    			 
    			 
    			 boolean a2 = true;
    			 int x2 = 2;
    			 while(a2)
    			 {
    				 for(int i = 1; i <= 20; i++)
    				 {
    					 if(a[x2][i] == 1)
    					 {
    						 x2 = i;
    						 number2++;
    						 a2 = true;
    						 break;
    					 }
    					 else
    					 {
    						 a2 = false;
    					 }
    					
    				 }
    			 }
    			 
    			 if(number1 == number2)
    			 {
    				 System.out.println("You are my brother");
    			 }
    			 else if(number1 > number2)
    			 {
    				 System.out.println("You are my elder");
    			 }
    			 else
    			 {
    				 System.out.println("You are my younger");
    			 }
    		}
    		
    		
    		
    	}
    }
    
    • 1

    信息

    ID
    1325
    时间
    1000ms
    内存
    32MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者