Dynamic Programming!


#1

Has anybody solved this using Dynamic Programming?


#2

It’s a variation of unbounded knapsack. Hope I helped without spoiling the question :slight_smile: