2880: 计算鞍点

解题思路:

注意事项:

参考代码:

rowm = []

l = []

for i in range(5):

    s = list(map(int,input().split()))

    l.append(s)

    rowm.append(max(s))

c = 0

for i in range(5):

    flag =True

    a = l[i].index(rowm[i])

    for j in range(5):

        if rowm[i] > l[j][a]:

            flag = False

    if flag:

        c += 1

        print(i+1,a+1,rowm[i])

if c == 0:

    print("not found")