题解 | #迷宫问题#

def dfs(x,y,path):
    if x==m-1 and y==n-1:
        return path
    paths=[]
    if x-1>=0 and graph[x-1][y]==0 and (x-1,y) not in path:
        paths.extend(dfs(x-1,y,path+[(x-1,y)]))
    if x+1<=m-1 and graph[x+1][y]==0 and (x+1,y) not in path:
        paths.extend(dfs(x+1,y,path+[(x+1,y)]))
    if y-1>=0 and graph[x][y-1]==0 and (x,y-1) not in path:
        paths.extend(dfs(x,y-1,path+[(x,y-1)]))
    if y+1<=n-1 and graph[x][y+1]==0 and (x,y+1) not in path:
        paths.extend(dfs(x,y+1,path+[(x,y+1)]))
    return paths    
while True:
    try:
        number=list(map(int,input().split()))
        m=number[0]
        n=number[1]
        graph=[]
        for i in range(m):
            graph.append(list(map(int,input().split())))
        path=[(0,0)]
        res=dfs(0,0,path)
        print("\n".join([f"({x},{y})" for x, y in res])) 
    except:
        break