2882: 矩阵归零消减序列和

解题思路:

注意事项:

参考代码:

n = int(input())

l = []

row = []

cul = []

for i in range(n):

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

    l.append(s)

for k in range(n-1):   # 开始n-1个操作

    row = []

    cul = []

    print(l[1][1])

    for i in range(n): # 求每行最小值

        min = l[i][0]

        for j in range(n):

            if l[i][j] < min:

                min = l[i][j]

        row.append(min)

    for i in range(n):  # 对每行进行减去最小值

        for j in range(n):

            l[i][j] -= row[i]

    for i in range(n): # 求每列最小值

        min = l[0][i]

        for j in range(n):

            if l[j][i] < min:

                min = l[j][i]

        cul.append(min)

    for i in range(n):  # 对每列进行减去最小值

        for j in range(n):

            l[j][i] -= cul[i]

    x = l[1][1]

    for i in range(n):

        l[i].pop(1)

    l.pop(1)

    n -= 1

print(x)