Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
65466 | jdf_wangqingyu | 计算鞍点 | C++ | Accepted | 0 MS | 252 KB | 524 | 2025-05-21 16:50:26 |
#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int matrix[n][n]; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin>>matrix[i][j]; } } for(int i=0;i<n;i++){ int rowMax=matrix[i][0]; int colIndex; for(int j=1;j<n;j++){ if(matrix[i][j]>rowMax){ rowMax=matrix[i][j]; colIndex=j; } } bool isSaddlePoint=true; for(int k=0;k<n;k++){ if(matrix[k][colIndex]<rowMax){ isSaddlePoint=false; } } if(isSaddlePoint){ cout<<rowMax<<" "; } } }