找二维数组鞍点

#include <stdio.h>void main(){int a[4][5],i,j,max,min,k,n;for (i=0; i<4; i++)for (j=0; j<5; j++)scanf("%d",&a[i][j]);for (i=0; i<4; i++){max = a[i][0];for (j=0; j<5; j++){if (max<a[i][j])max = a[i][j];}min = max;for (k=0; k<4; k++){if (min>a[k][j-1])min=a[k][j-1]; } if (min==max){printf("%d %d %d/n",max,i,j-1);n++;}}if (n==0)printf("no exist/n");}