文件名称:2
介绍说明－－下载内容均来自于网络，请自行研究使用
有一个箱子容量为V(正整数，0≤V≤20000），同时有n个物品（0≤n≤30),每个物品有一个体积（正整数）。要求从n个物品中，任取若干个装入箱内，使箱子的剩余空间为最小。
-Capacity of a box V (positive integer, 0 ≤ V ≤ 20000), at the same time there are n items of (0 ≤ n ≤ 30), each item has a size (positive integer). N months from the items, any number of load check box to enable the box for the smallest of the remaining space.
-Capacity of a box V (positive integer, 0 ≤ V ≤ 20000), at the same time there are n items of (0 ≤ n ≤ 30), each item has a size (positive integer). N months from the items, any number of load check box to enable the box for the smallest of the remaining space.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1.doc