{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"Define a two-dimensional array:\n\u003cbr\u003e\u003cpre\u003e\r\u003cbr\u003eint maze[5][5] \u003d {\r\u003cbr\u003e\t0, 1, 0, 0, 0,\r\u003cbr\u003e\t0, 1, 0, 1, 0,\r\u003cbr\u003e\t0, 0, 0, 0, 0,\r\u003cbr\u003e\t0, 1, 1, 1, 0,\r\u003cbr\u003e\t0, 0, 0, 1, 0,\r\u003cbr\u003e};\u003c/pre\u003e\n\u003cbr\u003eIt represents a maze, where 1 represents a wall, 0 represents a path that can be walked on. You can only move horizontally or vertically, not diagonally. Write a program to find the shortest path from the top left corner to the bottom right corner."}},{"title":"Input","value":{"format":"HTML","content":"A 5 × 5 two-dimensional array representing a maze. It is guaranteed to have a unique solution."}},{"title":"Output","value":{"format":"HTML","content":"The shortest path from the top left corner to the bottom right corner, in the format shown in the sample."}},{"title":"Sample","value":{"format":"HTML","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\r\n0 1 0 1 0\r\n0 0 0 0 0\r\n0 1 1 1 0\r\n0 0 0 1 0\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e(0, 0)\r\n(1, 0)\r\n(2, 0)\r\n(2, 1)\r\n(2, 2)\r\n(2, 3)\r\n(2, 4)\r\n(3, 4)\r\n(4, 4)\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}}]}