尋找二維數組的鞍點

#include<iostream> #include<math.h> #define N 100 using namespace std; int main() { int num[N][N],value,hei,wei,i,j,k,flag; int m,n; cout<<"輸入數組的行數和列數"; cin>>m>>n; cout<<"輸入數組的數字"; for(i=0;i<m;i

>>阅读原文<<