EX7_2:鞍点

4 
1 7 4 1 
4 8 3 6 
1 6 1 2 
0 7 8 9

#include <stdio.h>

int a[101][101];

// 读入矩阵
int readMaxtrix(int a[][101], int n)
{
    // 保留0行，0列
    for (int i=1; i<=n; ++i)
        for (int j=1; j<=n; ++j)
            scanf("%d", &a[i][j]);
    return 0;
}

int saddle(int a[][101], int n)
{
    int found=0;
    // 将每一行的最大数放到0列
    for (int i=1; i<=n; ++i)
    {
        int maxValue=a[i][1], maxRow=1;
        for (int j=2; j<=n; ++j)
            if (a[i][j]>maxValue)
            {
                maxValue = a[i][j];
                maxRow = j;
            }
        a[i][0] = maxRow;
    }
     // 将每一列的最小数放到0行
    for (int j=1; j<=n; ++j)
    {
        int minValue=a[1][j], minCol=1;
        for (int i=2; i<=n; ++i)
            if (a[i][j]<minValue)
            {
                minValue = a[i][j];
                minCol = i;
            }
        a[0][j] = minCol;
    }
    // 查找鞍点
    for (int i=1; i<=n; ++i)
        if (a[0][a[i][0]]==i)
        {
            found=1;
            printf("%d %d\n", i-1, a[i][0]-1);
        }
    return found;
}

int printMaxtrix(int a[][101], int n)
{
    for (int i=0;i<=n;i++)
    {
        for (int j=0; j<n; j++)
            printf("%d ", a[i][j]);
        printf("%d\n", a[i][n]);
    }
    return 0;
}

int main()
{
    int n;
    scanf("%d", &n);
    readMaxtrix(a, n);
    if (!saddle(a, n))
        printf("NO\n");
    return 0;
}