Prereq: Knapsack Intro

This problem is similar to Perfect Squares, except a number can only be used once. Again, we ask you to output the minimum number of numbers in order to sum to the desired number. Output -1 if the number can't be reached.

You cannot make 12 with any combination of 1, 4, 9.

13 = 4 + 9