题解 | #HJ43 迷宫问题#

def walk(i, j, path):
    if (j+1 < n) and (maze[i][j+1] == 0) and ((i, j+1) not in path): # 向右可以走 且 没走过
        walk(i, j+1, path + [(i, j+1)])
    if (j-1 >= 0) and (maze[i][j-1] == 0) and ((i, j-1) not in path): # 向左可以走 且 没走过
        walk(i, j-1, path + [(i, j-1)])
    if (i+1 < m) and (maze[i+1][j] == 0) and ((i+1, j) not in path): # 向下可以走 且 没走过
        walk(i+1, j, path + [(i+1, j)])
    if (i-1 >= 0) and (maze[i-1][j] == 0) and ((i-1, j) not in path): # 向上可以走 且 没走过
        walk(i-1, j, path + [(i-1, j)])
    if (i, j) == (m-1, n-1): # 到达出口
        for p in path:
            print(f"({p[0]},{p[1]})")

while True:
    try:
        m, n = list(map(int, input().split()))
        maze = [[i for i in map(int, input().split())] for _ in range(m)]
        path = [(0,0)]
        walk(0, 0, path)
    except:
        break