该程序是采用贪婪法编制的一个小程序，解决问题是：有编号为1到n的物品，各物品的体积已知。将其装入体积均为V的箱子里，所用箱子要少-that the procedure was used in the preparation of greedy law a small program to solve the problem is : No. 1 to n items, the volume of goods known. Its size will load all the boxes V, using fewer boxes