Description: HMH Desert legend has a M* N maze, there are many hidden treasures. One day, Dr.Kong found a map of the maze, the maze everywhere he found treasures, the most precious treasure is hidden in the bottom right corner of the maze of import and export in the upper left corner. Of course, the maze path is not flat, full of traps. Dr.Kong decided to let his robot Caddo go on a safari. But robots Caddo went from the top left bottom right corner, only to go down or go right. Come from the lower right back left corner, only to go up or go left, and Caddo no turning back. (Ie: a point after a maximum). Of course, it took Caddo smoothly along each treasure. Dr.Kong hopes his robot Caddo bring out as many treasures. Please write a program to help Dr.Kong calculations, cards up to bring out many more treasures.
To Search:
File list (Check if you may need any files):
2dp.cpp
Download