greedy algorithmEnter a high precision the file is an integer N, remove any of the number of S after the number of the left and right in order to form a new positive integer. Programming for a given N and S, looking for a solution that makes the number of the remaining number of the smallest number of new. The new integer output

greedy algorithm
................\贪 婪 问 题.doc
................\贪婪的送礼者.cpp

• 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．