Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
49465 | 冯诚阳 | 计算鞍点 | C++ | Accepted | 1 MS | 268 KB | 814 | 2023-07-05 14:23:45 |
# include<iostream> # include<cmath> # include<cstdio> using namespace std; int main(){ //OJ1485 int arr[5][5]={0},i=0,j=0,max=0,min=0,flag=0,n=0,m=0; for (i=0;i<5;i++){ for (j=0;j<5;j++){ cin>>arr[i][j]; } } for (i=0;i<5;i++){ max=0; min=1000; for (j=0;j<5;j++){ if (max<arr[i][j]){ max=arr[i][j]; n=j; } } for (j=0;j<5;j++){ if (min>arr[j][n]){ min=arr[j][n]; m=j; } } if (max==min){ break; } } if (max==min){ cout<<m+1<<" "<<n+1<<" "<<max<<endl; } else{ cout<<"not found"<<endl; } return 0; }