题解 | 迷宫问题

h, w = map(int, input().split())
mat = [list(map(int, input().split())) for _ in range(h)]

# Algo
def dfs(mat, i, j, path):
    if i+j == w+h-1:
        print('\n'.join(f"({t[0]},{t[1]})" for t in path))
        exit()
    elif i < 0 or i >= h or j < 0 or j >= w:
        return
    elif mat[i][j]:
        return
    for u, v in [(i, j-1), (i-1, j), (i, j+1), (i+1, j)]:
        mat[i][j] = 1
        path.append((i, j))
        dfs(mat, u, v, path)
        path.pop()
        mat[i][j] = 0

# Call
dfs(mat, 0, 0, [])