第四章 7-21 找鞍点

n=int(input())
matrix=[]
for i in range(n):
    ni = list(map(int,input().split()))
    matrix.append(ni)
c=[]
d=[]
for i in range(n):
    max_mat = max([matrix[i][j] for j in range(n)])
    min_mat = min([matrix[k][i] for k in range(n)])
    c+=([(i,j) for j in range(n) if matrix[i][j]==max_mat])
    d+=([(k,i) for k in range(n) if matrix[k][i]==min_mat])
rs = []
for e in c:
    if e in d:
        rs.append(e)
if rs!=[]:
    print(*rs[0])
else:
    print('NONE')

# 这部分代码有问题 有一个测试不对 但是我也不知道问题在哪了

n=int(input())
matrix=[]
for i in range(n):
    ni = list(map(int,input().split()))
    matrix.append(ni)
t=[]
flag=0
for row_i in range(n):
    max_in_row = max(matrix[row_i]) # 该行最大
    max_index_in_row = matrix[row_i].index(max_in_row) # 改行最大值的索引
    col = []
    for j in range(n):
        col.append(matrix[j][max_index_in_row])
    min_in_col = min(col) # 该列最小
    min_index_in_col = col.index(min_in_col)
    if min_in_col==max_in_row:
        t.append((min_index_in_col,max_index_in_row))
        flag=1

if flag==0:
    print('NONE')
else:
    print(*t[0])