C++程序编程——找马鞍点

#include<stdio.h>

#define M 10

#define N 10

void main()

{

int a[M][N],i,j,k,key=0,num,m,n,max,min

printf("输入行数和列数：")

scanf("%d%d",&m,&n)

printf("按行顺序输入矩阵\n")

for(i=0i<mi++)

for(j=0j<nj++)

scanf("%d",&a[i][j])

for(i=0i<mi++)

{

max=a[i][0]

for(j=1j<nj++)

if(a[i][j]>max)

{

num=j

max=a[i][j]

}

min=a[0][num]

for(k=1k<mk++)

if(a[k][num]<min)

min=a[k][num]

if(max==min)

key=max

}

if(key)

printf("马鞍点：%d\n",key)

else

printf("没有马鞍点！\n")

}

#include#defineN10#defineM10voidmain(){inti,j,k,m,n,flag1,flag2,a[N][M],max,maxjprintf("输入行数n:")scanf("%d",&n)printf("\n输入列数m:")scanf("%d",&m)for(i=0imax){max=a[i][j]maxj=j}for(k=0,flag1=1ka[k][maxj])flag1=0if(flag1){printf("\n第%d行第%d列的%d是鞍点\n",i,maxj,max)flag2=1}}if(!flag2)printf("\n矩阵无鞍点！\n")}

#include<stdio.h>

int main()

{

int n, m, i, j, k, l, minn, maxx, flag

int a[256][256]

while(1)

{

printf("请输入矩阵的行列数：\n")

scanf("%d %d",&n,&m)

printf("请输入与行列数相符的矩阵：\n")

for( i =0 i <n i++)

for( j =0 j <mj++)

scanf("%d",&a[i][j])

flag = 0

printf("马鞍点输出(输出该点所在的行数与列数)：\n")

for( i = 0i <n i++)

{

for( j = 0j <mj++)

{

minn = a[i][j]

for( k = 0 k <mk++)

{

if( minn >a[i][k])

break

}

if( k == m)

{

maxx = a[i][j]

for( l = 0l <nl++)

{

if( maxx <a[l][j])

break

}

if( l == n)

{

printf("%d %d %d\n",i , j ,a[i][j])

flag = 1

}

}

}

}

if( flag == 0)

printf("此矩阵没有马鞍点")

printf("\n")

}

return 0

}

---