Description: Your friend Jefferson in a two-dimensional maze (which can be seen as a N* M a grid of squares) in lost
Way, he now knew his starting coordinates (startX, startY) and he needs to reach the destination coordinates (
destX, destY). However, there are many lattice maze is inaccessible, and some for a fee lattice
- To know Jefferson cash on hand (cash) is extremely limited. So now you need to write a program
To help him: a step given the number of shortest path, so that Jefferson could use the cash on hand at destination
.
1. Maze that maze with a two-dimensional matrix. When the user input N, M, the computer
An N* M randomly generated maze, and displayed. Note that the whole maze closed its borders must be*
A legal labyrinth input can be:
******
0500**
* 1120*
* 0000*
******
Among them, first column i row j if:
0: on behalf of sub-space
*: Representatives can not enter the lattice
k (1 <= k <= 9): representative of the grid will be a one-time charge k
To Search:
- [mg] - Through the keyboard input maze, and exp
File list (Check if you may need any files):
maze.txt
Download