last item if it doesn't fully fit. here -- which is exactly why the greedy choice is special. (For the 0/1 INDIVISIBLE version, brute force is 2^n.) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible resultsSome results have been hidden because they may be inaccessible to you
Show inaccessible results
