6

#这道题就挺离谱的#

n, m = map(int, input().split())
r, c = map(int, input().split())
mat = [[0] * m for y in range(n)]


def Mat(n, m, i, j, k):
    if n * m <= 0:
        return
    for y in range(m - 1):
        mat[i][j] = k
        j += 1
        k += 1
        print(mat)
    for x in range(n - 1):
        mat[i][j] = k
        i += 1
        k += 1
        print(mat)
    for y in range(m - 1):
        mat[i][j] = k
        j -= 1
        k += 1
        print(mat)
    for x in range(n - 1):
        mat[i][j] = k
        k += 1
        i -= 1
        print(mat)
    Mat(n - 2, m - 2, i + 1, j + 1, k)


i, j, k = 0, 0, 1
Mat(n, m, i, j, k)
print(mat[r - 1][c - 1])

我在上述的位置加入了几个测试代码（就是print（mat））

输出是：

[[1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]

[[1, 2, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]

[[1, 2, 3, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]

[[1, 2, 3, 4, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [0, 0, 0, 0, 7], [0, 0, 0, 0, 0]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [0, 0, 0, 0, 7], [0, 0, 0, 0, 8]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [0, 0, 0, 0, 7], [0, 0, 0, 9, 8]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [0, 0, 0, 0, 7], [0, 0, 10, 9, 8]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [0, 0, 0, 0, 7], [0, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [0, 0, 0, 0, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [0, 0, 0, 0, 6], [13, 0, 0, 0, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [14, 0, 0, 0, 6], [13, 0, 0, 0, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [14, 15, 0, 0, 6], [13, 0, 0, 0, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [14, 15, 16, 0, 6], [13, 0, 0, 0, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [14, 15, 16, 17, 6], [13, 0, 0, 0, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [14, 15, 16, 17, 6], [13, 0, 0, 18, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [14, 15, 16, 17, 6], [13, 0, 19, 18, 7], [12, 11, 10, 9, 8]]

[[1, 2, 3, 4, 5], [14, 15, 16, 17, 6], [13, 20, 19, 18, 7], [12, 11, 10, 9, 8]]

15

由此可见，它这个运行规律也是够离谱的

可见，它的规律大概是：

总体的数值是由1～20，但加入方式是先从头开始，将第一个列表填满后，依次在接下来的几个列表的末端添加，到底后，再反向重复此操作，直至20个数全部填完。

6