Description: Given an N* N square grid, set the upper left corner as a starting point ◎, coordinates (1,1), X-axis to the right is positive, Y axis under positive side of each box is 1. A car starting from the starting point towards the bottom right corner of the end ◎ ▲, the coordinates (N, N). In a number of grid intersection points, set the oil tanks, fuel for the car is moving his way. The car is moving process should observe the following rules: find cars starting from the starting point to reach the end of a driving route with the least paid.
To Search:
File list (Check if you may need any files):
car.cpp
Download