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.

home.cpp
home.ppt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．