0-1 knapsack problem described as follows: given m types of items and a backpack. Item i of the weight of w [i], a value of v [i], the capacity of backpack is c, asking how to choose the items into the backpack, making the backpack into the largest total value of goods. (Each item can only choose to put 0/1 knapsack)

a.txt

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