Description: Human beings must in the shortest possible time to move to the moon. N of the existing station is located between Earth and the moon, and there is public transport spacecraft m vessels shuttling back and forth in the meantime. Each station can accommodate an unlimited number of people, and i each spacecraft can accommodate H [i] of individuals. Each spacecraft will periodically call a series of space station, for example: (1,3,4) that the spacecraft docking station will be periodically 134,134,134 .... Each spacecraft a space station from a time-consuming drive to any one station are 1. One can only spacecraft docked at the space station (or the moon, the Earth) when on the ship. All of the initial full-time on Earth, the spacecraft in the initial station-wide.
Try to design an algorithm to find all as soon as possible so that all transferred to the moon on the transport program.
To Search:
File list (Check if you may need any files):
home.cpp
home.ppt
Download