Subject: i disagree with the answer of this question
it should be 1 less than whatever the algorithm produces. here is my
solution, assume dollar amount is X
The largest bag should have X/2 rounded up to the nearest dollar, the second
largest bag should be at least half of the remaining amount, and so on...
to prove it, look at it from bottom up: the last bag must have 1, and second
last bag have 2... its too much to type in this text box, think about it...