Printing solutions of Recursive DP problem

Revision en1, by DonMichaelCorleone, 2016-08-14 13:01:40

How to print all the solutions of a knapsack DP problem solved by recursive manner ? Where every element can be picked more than one time.

I only can print the result ( like "yes"/"no", maximum sum/minimum cost etc, number of ways etc).

Sorry for my bad English.

Tags dp, knapsack, printing solution


  Rev. Lang. By When Δ Comment
en1 English DonMichaelCorleone 2016-08-14 13:01:40 311 Initial revision (published)