1 条题解
-
0
C :
#include<stdio.h> int main(){ int a[200]; int i,j,n,temp; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n;i++) for(j=0;j<n-i-1;j++){ if(a[j]>a[j+1]){ temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } for(i=0;i<n;i++) printf("%d ",a[i]); printf("\n"); return 0; }
C++ :
#include <stdio.h> int main() { int n, i, j, temp; int a[200]; scanf("%d", &n); for (i = 0;i < n;i++) scanf("%d", &a[i]); for (i = 0;i < n;i++) { for (j = 0;j + i + 1 < n;j++) { if (a[j] > a[j + 1]) { temp = a[j]; a[j] = a[j + 1]; a[j + 1] = temp; } } } for (i = 0;i < n;i++) { printf("%d ", a[i]); } puts(""); return 0; }
Pascal :
var a:array[1..200] of longint; i,j,t,n:longint; begin readln(n); 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) { int n=0; Scanner cin = new Scanner(System.in); n = cin .nextInt(); int number = n; int arr[]=new int[ n ]; for( int i=0;i< n ;i++ ) { arr[i] = cin.nextInt(); } for( int i = 0 ;i<number;i++ ) { for( int j=i+1;j<number;j++ ) { if( arr[i]>=arr[j] ) { int temp = 0 ; temp= arr[i]; arr[i]=arr[j]; arr[j]=temp; } } } for( int i=0;i<arr.length;i++) { System.out.printf("%d ",arr[i]); } System.out.println(); } }
Python :
input() a = sorted([int(i) for i in raw_input().split()]) for i in a: print i, print ""
- 1
信息
- ID
- 1290
- 时间
- 1000ms
- 内存
- 32MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者