#include <iostream>
#include <cstdio>
using namespace std;
int a[105][105];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", a[i][j]);
}
}
int num = n;
for (int i = 1; i <= num; i++) {
cout << a[2][2] << endl;
int minR;
for (int j = 1; j <= n; j++) {
minR = 1e9;
for (int k = 1; k <= n; k++) {//找出此行的最小值
if (a[j][k] < minR) minR = a[j][k];
}
if (minR == 0) continue;//行最小值为0不做归零操作
else {
for (int k = 1; k <= n; k++) {//行元素归零
a[j][k] -= minR;
}
}
}
int minC;
for (int j = 1; j <= n; j++) {
minC = 1e9;
for (int k = 1; k <= n; k++) {//找出此列的最小值
if (a[k][j] < minC) minC = a[k][j];
}
if (minC == 0) continue;//列最小值为0不做归零操作
else {
for (int k = 1; k <= n; k++) {//列元素归零
a[k][j] -= minC;
}
}
}
for (int j = 2; j < n; j++) {//删除第二行
for (int k = 1; k <= n; k++) {
a[j][k] = a[j + 1][k];
}
}
for (int j = 2; j < n; j++) {//删除第二列
for (int k = 1; k < n; k++) {
a[k][j] = a[k][j + 1];
}
}
n--;
}
return 0;
}
poj 矩阵归削减序列和
最新推荐文章于 2023-12-24 15:03:59 发布