1 条题解

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

    C :

    #include<stdio.h>
    
    int main()
    {
    	int t,i,a[3],b[3];
    	scanf("%d",&t);
    	while(t--)
    	{
    		for(i=0;i<3;i++)
    			scanf("%d",&a[i]);
    		for(i=0;i<3;i++)
    			scanf("%d",&b[i]);
    		if(a[0]>b[0])
    			printf("First\n");
    		else if(a[0]<b[0])
    			printf("Second\n");
    		else
    		{
    			if(a[1]>b[1])
    				printf("First\n");
    			else if(a[1]<b[1])
    				printf("Second\n");
    			else
    			{
    				if(a[2]>b[2])
    					printf("First\n");
    				else if(a[2]<b[2])
    					printf("Second\n");
    				else
    					printf("Same\n");
    			}
    		}
    	}
    	return 0;
    }
    

    C++ :

    #include<stdio.h>
    
    int main()
    {
    	int t,i,a[3],b[3];
    	scanf("%d",&t);
    	while(t--)
    	{
    		for(i=0;i<3;i++)
    			scanf("%d",&a[i]);
    		for(i=0;i<3;i++)
    			scanf("%d",&b[i]);
    		if(a[0]>b[0])
    			printf("First\n");
    		else if(a[0]<b[0])
    			printf("Second\n");
    		else
    		{
    			if(a[1]>b[1])
    				printf("First\n");
    			else if(a[1]<b[1])
    				printf("Second\n");
    			else
    			{
    				if(a[2]>b[2])
    					printf("First\n");
    				else if(a[2]<b[2])
    					printf("Second\n");
    				else
    					printf("Same\n");
    			}
    		}
    	}
    	return 0;
    }
    

    Java :

    import java.util.Scanner;
    
    public class Main {
    	//转换int成为ascii码值
    	/*
    	 public static char toChar(int prefix){
    		return (char) prefix;
    	}
    	*/
    	//输入整型
    	/*
    	public static int scanfInt(){
    		@SuppressWarnings("resource")
    		Scanner sc = new Scanner(System.in);
    		return sc.nextInt();
    	}
    	*/
    	//输入float
    	/*
    	public static float scanfFloat(){
    		@SuppressWarnings("resource")
    		Scanner sc = new Scanner(System.in);
    		return sc.nextFloat();
    	}
    	*/
    	//判断字符c是否在set中
    	/*
    	public static boolean isInSet(char c){
    		if(c == 'A' || c == 'B' || c == 'C' || c == 'D' || c == 'F'){
    			return true;
    		}
    		else
    			return false;
    	}
    	*/
    	public static String judgeEdition(int i){
    		if(i == 0)
    			return "Same";
    		else if(i == 1)
    			return "First";
    		else
    			return "Second";
    	}
    	public static void main(String[] args){
    		@SuppressWarnings("resource")
    		Scanner sc = new Scanner(System.in);
    		int flag = sc.nextInt();
    		int[][][] edition = new int[flag][2][3];
    		int[] result = new int[flag];
    		for(int i=0;i<flag;i++){
    			edition[i][0][0] = sc.nextInt();
    			edition[i][0][1] = sc.nextInt();
    			edition[i][0][2] = sc.nextInt();
    			edition[i][1][0] = sc.nextInt();
    			edition[i][1][1] = sc.nextInt();
    			edition[i][1][2] = sc.nextInt();
    			//版本号相等
    			if(edition[i][0][0] == edition[i][1][0]){
    				//子版本号相等
    				if(edition[i][0][1] == edition[i][1][1]){
    					//修订号相等
    					if(edition[i][0][2] == edition[i][1][2]){
    						result[i] = 0;
    					}
    					//第一个修订号大
    					else if(edition[i][0][2] > edition[i][1][2]){
    						result[i] = 1;
    					}
    					//第二个修订号大
    					else 
    						result[i] = 2;
    				}
    				//子版本号第一个大
    				else if(edition[i][0][1] > edition[i][1][1]){
    					result[i] = 1;
    				}
    				//子版本号第二个大
    				else
    					result[i] = 2;
    			}
    			//版本号第一个大
    			else if(edition[i][0][0] > edition[i][1][0]){
    				result[i] = 1;
    			}
    			//版本号第二个大
    			else
    				result[i] = 2;
    		}//end of for structure
    		//display result
    		for(int i = 0;i <flag;i++){
    			System.out.println(judgeEdition(result[i]));
    		}
    		
    			
    		
    	}
    }
    

    Python :

    #coding = utf-8
    
    import re
    import sys
    
    f = sys.stdin;
    #f = open('test.in', 'r');
    
    def Process(v1, v2):
    	version1 = [];
    	version2 = [];
    	for var in v1:
    		if( '' == var ):
    			continue;
    		version1 += [var];
    
    	for var in v2:
    		if( '' == var ):
    			continue;
    		version2 += [var];
    
    	# print version1;
    	# print version2;
    	for i in range(0, 3):
    		if( int(version1[i]) > int(version2[i]) ):
    			return 'First';
    		elif( int(version1[i]) < int(version2[i]) ):
    			return 'Second';
    	return 'Same';
    
    cas = int(f.readline().split(' ')[0]);
    for k in range(0, cas):
    	version1 = f.readline().split(' ');
    	version2 = f.readline().split(' ');
    	print (Process(version1, version2));
    
    
    • 1

    信息

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