1 solutions
-
0
C :
# include <stdio.h> int main() { int a[10]; int i,j,t; for(i=0;i<10;i++) scanf("%d",&a[i]); for(j=0;j<9;j++) for(i=0;i<9-j;i++) if(a[i]>a[i+1]) { t=a[i]; a[i]=a[i+1]; a[i+1]=t; } for(i=0;i<10;i++) printf("%d\n",a[i]); return 0; }C++ :
# include<stdio.h> #include<stdlib.h> int main() { int a[10]; int i,j,t; for(i=0;i<9;i++) scanf("%d",&a[i]); scanf("%d",&a[9]); for(j=0;j<9;j++) for(i=0;i<9-j;i++) if(a[i]>a[i+1]) { t=a[i];a[i]=a[i+1];a[i+1]=t; } for(i=0;i<10;i++) printf("%d\n",a[i]); }Pascal :
var a:array[0..14]of longint; i,x:longint; begin for i:=1 to 9 do read(a[i]); read(x); for i:=1 to 9 do if a[i]<x then writeln(a[i]) else break; writeln(x); for x:=i to 9 do writeln(a[x]);end.Python :
# coding=utf-8 li=input().split() num1=int(input()) for _ in range(len(li)): if num1<int(li[_]): li.insert(_,num1) break elif _==len(li)-1: li.insert(_, num1) for _ in li: print(_)
- 1
Information
- ID
- 17980
- Time
- 1000ms
- Memory
- 12MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By