有一个m*n格的迷宫(表示有m行、n列)，其中有可走的也有不可走的，如果用1表示可以走，0表示不可以走，文件读入这m*n个数据和起始点、结束点(起始点和结束点都是用两个数据来描述的，分别表示这个点的行号和列号)。现在要你编程找出所有可行的道路，要求所走的路中没有重复的点，走时只能是上下左右四个方向。如果一条路都不可行，则输出相应信息(用-l表示无路)。 -A m* n grid of a maze (that has m lines, n out), which may also not go away, if that can go with 1, 0 that can not leave, this document is read into m* n data and the starting point and end point (the starting point and end point are used to describe the two data, respectively, the point that the line number and column number). Programming you have to find all possible roads, the request path does not repeat the point, can only be walking up and down around the four directions. If a road is not feasible, then output the corresponding information (that have no use-l).