#include<stdio.h>
int main()
{
int a[10][10];
int m, n, g, j, k, l=0, h=0;
int max = 0, min = 0;
scanf("%d%d", &m, &n);
for (j = 0; j < m; j++)
{
for (k = 0; k < n; k++)
{
scanf("%d", &a[j][k]);
}
}
for (j = 0; j < m; j++)
{
max = a[j][0];
for (k = 0; k < n; k++)
{
if (max < a[j][k])
{
max = a[j][k];
l = k;
}
}
min = a[j][l];
for (j = 0; j < m; j++)
{
if (min > a[j][l])
{
min = a[j][l];
h = j;
}
}
if (max == min)
{
printf("Array[%d][%d]=%d", h, l, a[h][l]);
break;
}
}
if(max!=min)
{
printf("None");
}
return 0;
}
矩阵鞍点计算
最新推荐文章于 2024-07-25 23:26:35 发布