(Stamps) envisaged a national issue of n different denominations of the stamps, and on the assumption that each letter on maximum allowed m stamp affixed. For a given set of values m and n, write an algorithm obtained from the beginning of a postage for an increment in the circumstances, may be the greatest value of the postage for regional as well as in this area of the face value of all possible combinations. For example : n = m = 4 and 5, if the values of (1,4,12,21) of the four stamps, Postage is the largest regional consecutive 1-71. There are other denominations in the four stamps can be combined into the same size of the region?

可执行程序
..........\Project1.exe

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