一天一个小算法（鞍点的实现）

#include using namespace std; #define N 5 int a[N][N];
int main() { int Max, Min, Ni, Nj; int q = 0; system(“title yourname”); for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) cin >> a[i][j]; } int i, j; for ( i = 0; i < N; i++) { Max = a[i][0]; for ( j = 0; j < N; j++) { if (a[i][j]>=Max) { Ni = i; Nj = j; Max = a[i][j]; } } Min = Max; for (int k = 0; k < N; k++) { if (a[k][Nj] < Min) Min = a[k][N

一天一个小算法（鞍点的实现）最先出现在Python成神之路。