Matrix50. Дана матрица размера M × N. Преобразовать матрицу, поменяв местами минимальный и максимальный элемент в каждом столбце.
>Решение Pascal
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 | program Matrix50; type matrix = array [1..10,1..10] of integer; var a:matrix; Min, Max, M, N, i, j, K1, K2:Integer; procedure Swap(var X,Y:Integer); begin if x<>y then begin X:=X+Y; Y:=X-Y; X:=X-Y; end; end; begin Write('N: '); Readln(N); Write('M: '); Readln(M); for i:=1 to M do begin writeln(i,': '); for j:=1 to N do begin Write(j,' : '); Read(a[i,j]); end; end; for j:=1 to N do begin Max:=1; Min:=1; for i:=2 to M do begin if a[i,j]>a[Max,j] then Max:=i; if a[i,j]<a[Min,j] then Min:=i; end; Swap(a[Max,j],a[Min,j]); end; for i:=1 to M do begin for j:=1 to N do begin Write(' : ',a[i,j]); end; writeln(' : '); end; end. |
c++
#include
using namespace std;
int main() {
int n, m;
cin >> m >> n;
int arr[m][n];
cout << "initial : " << endl;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
arr[i][j] = rand() % 101;
cout << arr[i][j] << " ";
}
cout << endl;
}
for (int i = 0; i < n; ++i) {
int point_min = 0;
int point_max = 0;
for (int j = 0; j arr[point_max][i]) {
point_max = j;
} else if (arr[j][i] < arr[point_min][i]) {
point_min = j;
}
}
swap(arr[point_min][i], arr[point_max][i]);
}
cout << "changed : " << endl;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
cout << arr[i][j] << " ";
}
cout << endl;
}
return 0;
}