結果 : write a program for 0 1 knapsack problem using dynamic programming