装箱问题解法集，共5个。

问题：有一个箱子容量为v(正整数，o≤v≤20000)，同时有n个物品(o≤n≤30)，每个物品有一个体积 (正整数)。要求从 n 个物品中，任取若千个装入箱内，使箱子的剩余空间为最小。 -Bin-packing problem solution sets, a total of 5. Q: Is there a box capacity of v (a positive integer, o ≤ v ≤ 20000), at the same time there are n-items (o ≤ n ≤ 30), each item has a size (positive integer). Request from the n-value items, either check box if the 1000 loaded, so that the remaining space for the smallest box.