Skip to content

Instantly share code, notes, and snippets.

@daniilgri
Created December 26, 2018 16:52
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save daniilgri/41cb0d05e4406added8948b66e803e82 to your computer and use it in GitHub Desktop.
Save daniilgri/41cb0d05e4406added8948b66e803e82 to your computer and use it in GitHub Desktop.
#include "pch.h"
#include <stdio.h>
#include <conio.h>
#include <windows.h>
#include <math.h>
int main() {
SetConsoleOutputCP(1251);
SetConsoleCP(1251);
int n, m;
int i, j;
printf("Введите n и m\n");
scanf_s("%i%i", &n, &m);
int arr[10][10];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
printf("arr[%i][%i] = ", i + 1, j + 1);
scanf_s("%i", *(arr + i) + j);
}
}
int mi = 0, mj = 0;
int max = abs(arr[mi][mj]);
for (i = 0; i < n; i++) {
j = i == 0 ? 1 : 0;
while (j < n) {
if (max < arr[i][j]) {
max = abs(arr[i][j]);
mi = i;
mj = j;
}
j++;
}
}
// replace rows
int tmp;
for (i = mi + 1; i < n; i++) {
for (j = 0; j < m; j++) {
tmp = arr[i-1][j];
arr[i - 1][j] = arr[i][j];
arr[i][j] = tmp;
}
}
// replace columns
for (j = mj + 1; j < m; j++) {
for (i = 0; i < n; i++) {
tmp = arr[i][j - 1];
arr[i][j - 1] = arr[i][j];
arr[i][j] = tmp;
}
}
for (i = 0; i < n - 1; i++) {
for (j = 0; j < m - 1; j++) {
printf(" arr[%i][%i] = %i ", i + 1, j + 1, arr[i][j]);
}
printf("\n");
}
_getch();
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment