Description: issue a travel home to travel home to drive a car with the minimum of cost yi used from one city to another city (assuming starting at the fuel tank was empty). Given the two cities for the distance between D1, car fuel tank capacity of the C (in liters) per liter petrol traveling distance to the D2, the starting point liter gasoline prices P and several petrol stations along the N (N can be zero), PFS i distance from the starting point Di per liter Steam oil prices Pi (i = 1,2 ... N). Calculation results rounded to two decimal places. If unable to reach their destination, the export of "No Solution."
To Search:
- [BLINE] - series of the C language types graphics
- [VSNetToolBar_src] - visual studio.Net tool bar source code
- [Clex] - The morphology analyzer realizes the c
- [Lazhi] - works inclined straightening procedures,
File list (Check if you may need any files):
Download