题解 | #迷宫问题#

while 1:
    try:
        n,m = [int(i) for i in input().split()]
        maze = []
        maze.append([1]*(m+1))
        for i in range(n):
            maze.append([1]+[int(i) for i in input().split()]+[1])
        maze.append([1]*(m+1)) #wall
        def path(maze):
            i,j = (1,1)
            ei,ej = (n,m)
            stack = [(1,1)]
            maze[1][1] = 1
            while stack:
                i,j = stack[-1]
                if (i,j) == (ei,ej):
                    break
                for di,dj in [(-1,0),(1,0),(0,-1),(0,1)]:
                    if maze[i+di][j+dj] == 0:
                        maze[i+di][j+dj] = 1
                        stack.append((i+di,j+dj))
                        break
                else:
                    stack.pop()
            return(stack)
        A = (path(maze))
        for i in range(len(A)):
            a = A[i][0]-1
            b = A[i][1]-1
            print( '(' + str(a) +','+ str(b) + ')')

    except:
        break