1 条题解
-
0
C :
#include <stdio.h> #include<math.h> #define ARRAY_SIZE 10 int main (void){ int i,n,min,p; int a[ARRAY_SIZE]; scanf("%d",&a[0]); min=fabs(a[0]); for(i=1;i<10;i++){ scanf("%d",&a[i]); if(fabs(a[i])<min) min=a[i]; p=1; } n=a[9]; a[9]=min; a[p]=n; printf("%d",a[0]); for(i=1;i<10;i++){ printf(" %d",a[i]); } return 0; }
C++ :
#include<iostream> #include<math.h> #include<cstdlib> using namespace std; int main() { int a[10]; int min, index = 0, temp; cin >> a[0]; min = a[0]; for (int i = 1; i != 10; i++) { cin >> a[i]; if (abs(a[i]) < abs(min)) { min = a[i]; index = i; } } temp = a[9]; a[9] = a[index]; a[index] = temp; cout << a[0]; for (int i = 1; i < 10; i++) cout << " " << a[i]; return 0; }
Pascal :
var a:array[1..10] of longint; p,i,t,min:longint; begin read(a[1]); min:=abs(a[1]); p:=1; for i:=2 to 10 do begin read(a[i]); if abs(a[i])<min then begin min:=abs(a[i]); p:=i; end; end; t:=a[p]; a[p]:=a[10]; a[10]:=t; for i:=1 to 9 do write(a[i],' '); writeln(a[10]); end.
- 1
信息
- ID
- 3096
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者