1 条题解

  • 0
    @ 2025-4-7 21:28:47

    C :

    #include <stdio.h>
    int main() {
            int val[10];
            int i, j, temp;
            for (i = 0;i < 10;i++)
                    scanf("%d", &val[i]);
            for (i = 0;i < 9;i++) {
                    for (j = i + 1;j < 10;j++) {
                            if (val[j] < val[i]) {
                                    temp = val[i];
                                    val[i] = val[j];
                                    val[j] = temp;
                            }
                    }
            }
            for (i = 0;i < 10;i++)
                    printf("%d ", val[i]);
            puts("");
            return 0;
    }
    

    C++ :

    #include <stdio.h>
    int main() {
    	int val[10];
    	int i, j, temp;
    	for (i = 0;i < 10;i++)
    		scanf("%d", &val[i]);
    	for (i = 0;i < 9;i++) {
    		for (j = i + 1;j < 10;j++) {
    			if (val[j] < val[i]) {
    				temp = val[i];
    				val[i] = val[j];
    				val[j] = temp;
    			}
    		}
    	}
    	for (i = 0;i < 10;i++)
    		printf("%d ", val[i]);
    	puts("");
    	return 0;
    }
    
    

    Pascal :

    const
      n=10;
    var
      a:array[1..n] of longint;
      i,j,t:longint;
    begin
      for i:=1 to n do read(a[i]);
      readln;
      for i:=1 to n-1 do
        for j:=i+1 to n do
        if a[i]>a[j] then begin t:=a[i]; a[i]:=a[j]; a[j]:=t; end;
      for i:=1 to n-1 do write(a[i],' ');
      writeln(a[n],' ');
    end.
    
    
    

    Java :

    import java.util.Scanner;
    
    public class Main {
    	public static void main (String[] args) {
    		Scanner in=new Scanner(System.in);
    	    int []a=new int[10];
    	    for(int i=0;i<10;i++)
    	    	a[i]=in.nextInt();
    	    java.util.Arrays.sort(a);
    	    for(int i=0;i<10;i++)
    	    	System.out.print (a[i]+" ");
    	    System.out.println ();
    	}
    }
    

    Python :

    a = sorted([int(i) for i in raw_input().split()])
    for i in a:
        print i,
    print ""
    
    • 1

    信息

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