Run ID:133924
提交时间:2025-10-25 10:41:06
#include<iostream> using namespace std; int main(){ int a[6][6]={0},max=0,min=1000,h=0,l=0; for(int i=1;i<=5;i++){ for(int j=1;j<=5;j++)cin>>a[i][j]; } for(int i=1;i<=5;i++){ max=0; min=1000; for(int j=1;j<=5;j++){ if(max<a[i][j]){ max=a[i][j]; l=j; } } for(int k=1;k<=5;k++){ if(min>a[k][l]){ min=a[k][l]; h=k; } } if(max==min)break; } if(max==min){ cout<<l<<" "<<h<<" "<<max; } else cout<<"not found"<<endl; return 0; }