{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Define a two-dimensional array, for example:\n\n```C++\nint maze[5][5] \u003d {\n\t0, 1, 0, 0, 0,\n\t0, 1, 0, 1, 0,\n\t0, 0, 0, 0, 0,\n\t0, 1, 1, 1, 0,\n\t0, 0, 0, 1, 0,\n};\n```\nIt represents a maze, in which $1$ represents the wall and $0$ represents a cell that can be visited. You can only walk horizontally and vertically. Find the shortest route from the upper left corner to the lower right corner."}},{"title":"Input","value":{"format":"MD","content":"You will be given a $5 \\times 5$ matrix representing a maze. The data guarantees a unique solution."}},{"title":"Output","value":{"format":"MD","content":"Print the shortest path from the upper left corner to the lower right corner, the format is as shown in the example.\n"}},{"title":"Sample","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e0 1 0 0 0\n0 1 0 1 0\n0 0 0 0 0\n0 1 1 1 0\n0 0 0 1 0\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e(0, 0)\n(1, 0)\n(2, 0)\n(2, 1)\n(2, 2)\n(2, 3)\n(2, 4)\n(3, 4)\n(4, 4)\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}