鞍点计算

#include<stdio.h>
#define N 100
int main()
{
    int i,j,k,row,line,flag;
    int a[N][N],b[N][N],m,n,max,min;
    while(scanf("%d%d",&m,&n)!=EOF )
    {
        flag=0;
        row=0;line=0;
        for(i=0;i<=m-1;i++)
        {
            for(j=0;j<=n-1;j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        for(i=0;i<=m-1;i++)
        {
            for(j=0;j<=n-1;j++)
            {
                if(j==0) {max=a[i][j];}
                if(a[i][j]>max) {max=a[i][j];line=j;}
            }
            for(j=0;j<=m-1;j++)
            {
                if(j==0) {min=a[j][line];row=j;}
                if(a[j][line]<min) {min=a[j][line];row=j;}
            }
            if(max==min) {flag=1;continue;}
        }
        if(flag)
        {
            printf("Array[%d][%d]=%d\n",row,line,min);
        }
        else printf("None\n");
    }
}