#include <stdio.h>
#define N 4
#define M 5
int main() {
int a[N][M], i, j, k, max,flag,flag1,count=0;
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++)
scanf("%d", &a[i][j]);
}
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
flag1 = 1; flag = 1; max = a[i][j]; //假设a[i][j]为最大值
for (k = 0; k < M; k++) { //固定i,循环列
if (max < a[i][k]) {
flag = 0; //若存在a[i][k]>max,则a[i][j]在该行不是最大,flag=0
break;
}
}
if(flag==1) {
for (k = 0; k < N; k++) {
if (max > a[k][j]) //同上
flag1 = 0;
}
}
if (flag==1&&flag1 == 1) {
count++;
printf("%d row=%d column=%d\n", max, i + 1, j + 1);
}
}
}
if (count == 0)
printf("Not found");
return 0;
}
C语言鞍点
最新推荐文章于 2022-05-31 18:24:34 发布