提交时间:2023-08-30 15:03:46
运行 ID: 26128
#include <iostream> using namespace std; int main() { int a[10][10]={}; int n; cin>>n; int i,j,max,point,flag=1; int cnt=0; for( i=0;i<n;i++){ for( j=0;j<n;j++){ cin>>a[i][j]; } } for(int i=0;i<n;i++){ max=a[i][0]; point=0; for(j=0;j<n;j++){ if(max<a[i][j]){ max=a[i][j]; point=j;//jilusuozailie } } flag=1; for(int l=0;l<n;l++){ if(max>a[l][point]){ flag=0; } } if(flag){ cout<<i+1<<" "<<point+1<<" "<<max<<endl; cnt++; return 0; } } if(cnt==0){ cout<<"not found"<<endl; } return 0; }