1 条题解

  • 0
    @ 2025-10-10 15:48:08

    C :

    #include<stdio.h>
    int main()
    {
        int a[7];
        int max=0,min=24;
        double t,s=0;
        for(int i=0;i<=6;i++)
        {
            scanf("%d",&a[i]);
            if(a[i]>=max)
                max=a[i];
            if(a[i]<=min)
                min=a[i];
            s=s+a[i];
        }
        t=s/7.0;
        printf("%.1lf %d %d",t,max,min);
            return 0;
    }
    

    C++ :

    #include <bits/stdc++.h>
    using namespace std;
    bool compare(int a,int b){
    	return a > b;
    }
    
    int main(){
    	int r[4010],i,n,k = 0,x;
    	cin>>n;
    	for(i = 0;i < n;i++){
    		cin>>x;
    		while(x != 0){
    			r[k] = x % 10;
    			x = x / 10;
    			k++;
    		}
    	}	
    	
    	sort(r,r+k,compare);
    	for(i = 0;i < k;i++){
    		cout<<r[i];
    	}
    	
    }
    

    Pascal :

    const n=7;
    var
            a:array[1..n] of integer;
            i,k,max,min:integer;
    begin
            for i:=1 to n do read(a[i]);
            max:=a[1];
            min:=a[1];
            for i:=1 to n do if a[i]>max then max:=a[i]
                                            else if a[i]<min then min:=a[i];
            for i:=1 to n do k:=k+a[i];
            write(k/n:0:1,' ',max,' ',min);
    end.
    

    Java :

    import java.util.Scanner;
    public class Main{
    	public static void main(String args[]){
    		Scanner in = new Scanner(System.in);
    		int a = in.nextInt();
    		int b = in.nextInt();
    		int c = in.nextInt();
    		int d = in.nextInt();
    		int e = in.nextInt();
    		int f = in.nextInt();
    		int g = in.nextInt();
    		int t = 0;
    		double y = 0;
    		if(a<b){
    			t = a;	
    			a = b;
    			b = t;
    		}
    		if(a<c){
    			t = a;	
    			a = c;
    			c = t;
    		}
    		if(a<d){
    			t = a;	
    			a = d;
    			d = t;
    		}
    		if(a<e){
    			t = a;	
    			a = d;
    			d = t;
    		}
    		if(a<f){
    			t = a;	
    			a = f;
    			f = t;
    		}
    		if(a<g){
    			t = a;	
    			a = g;
    			g = t;
    		}
    
    		if(g>f){
    			t = g;	
    			g = f;
    			f = t;
    		}
    		if(g>e){
    			t = g;	
    			g = e;
    			e = t;
    		}
    		if(g>d){
    			t = g;	
    			g = d;
    			d = t;
    		}
    		if(g>c){
    			t = g;	
    			g = c;
    			c = t;
    		}
    		if(g>b){
    			t = g;	
    			g = b;
    			b = t;
    		}
    		if(g>a){
    			t = a;	
    			a = g;
    			g = t;
    		}
    		y = (double)(a+b+c+d+e+f+g)/7;
    		System.out.print(String.format("%.1f",y)+" "+a+" "+g);						
    	}
    }
    

    Python :

    a,b,c,d,e,f,g=map(int,input().split())
    x=(a+b+c+d+e+f+g)/7
    y=a #用y来存放最大值 假设a是最大值
    if y<b:
        y=b
    if y<c:
        y=c
    if y<d:
        y=d
    if y<e:
        y=e
    if y<f:
        y=f
    if y<g:
        y=g
    z=a #用z来存放最小值 假设a是最小值
    if z>b:
        z=b
    if z>c:
        z=c
    if z>d:
        z=d
    if z>e:
        z=e
    if z>f:
        z=f
    if z>g:
        z=g
    print('%.1f'% x,y,z)
    
    • 1

    信息

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