1 条题解

  • 0
    @ 2023-6-11 12:20:56

    C :

    #include<stdio.h>
    int main()
    {
        int x,a,b,c,d,max=0;
        scanf("%d%d%d%d%d",&x,&a,&b,&c,&d);
        if(x>max)
            max=x;
    if(a>max)
        max=a;
        if(b>max)
            max=b;
        if(c>max)
            max=c;
        if(d>max)
            max=d;
        printf("%d",max);
        return 0;
    }
    
    

    C++ :

    #include <bits/stdc++.h>;
    using namespace std;
    int main(){
    	int a[5]={0};
    	int s,b,c,d,e;
    	cin>>s>>b>>c>>d>>e;
    	a[0]=s;
    	a[1]=b;
    	a[2]=c;
    	a[3]=d;
    	a[4]=e;
    	sort(a,a+5);
    	cout<<a[4]<<endl;
    }
    
    
    

    Java :

    import java.util.Scanner;
    public class Main
    {   
    	public static void main(String[] args){
            Scanner sc = new Scanner(System.in);
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int d = sc.nextInt();
            int e = sc.nextInt();
            int max = a;
            if(max<b) {
            	max=b;
            }
            if(max<c) {
            	max=c;
            }
            if(max<d) {
            	max=d;
            }
            if(max<e) {
            	max=e;
            }
            System.out.println(max);
        }
    }
    
    

    Python :

    n = input().split()
    a = int(n[0])
    b = int(n[1])
    c = int(n[2])
    d = int(n[3])
    e = int(n[4])
    ma = max(a, b, c, d, e)
    print(ma)
    
    • 1

    信息

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