提交时间:2024-03-01 15:47:19

运行 ID: 42543

#include <stdio.h> int main(){ int n; scanf("%d", &n); int s[n][n]; for(int i = 0; i <= n - 1; i++) for(int j = 0; j <= n - 1; j++) scanf("%d", &s[i][j]); for(int i = 0; i <= n - 1; i++) { int max = -1e+6; for(int j = 0; j <= n - 1; j++) if( s[i][j] > max ) max = s[i][j]; int t[n], count = 0; for(int k = 0; k <= n - 1; k++) if( s[i][k] == max ) t[count++] = k; for(int r = 0; r <= count - 1; r++) { int flag = 0; for(int q = 0; q <= n - 1; q++) { if( s[q][t[r]] < s[i][t[r]] ) { flag++; break; } } if(flag) continue; else { printf("%d %d\n", i, t[r]); return 0; } } } printf("NONE\n"); return 0; }