文件名称:giftalloc
介绍说明--下载内容均来自于网络,请自行研究使用
算法实验题 2.3 礼品分配问题
★问题描述:
节日快到了,班长给大家准备了 M 个同样的礼物。 由于礼物太多,不好携带,因此他
准备将 M 个礼物装到 N 个相同的塑料袋中(允许有塑料袋空着)。
注意,如果 N=3, M=7,那么 5,1,1 的装法和 1,5,1 的装法算是同一种装法。-Gift allocation algorithm experiment of the problem ★ 2.3 Problem Descr iption: Festival is coming, we prepared the squad for the M same gift. Because too many gifts, not to carry, so he prepared a gift attached to the M N identical plastic bag (allow empty bags). Note that if N = 3, M = 7, then 5,1,1 and 1,5,1 installation method of installation method regarded as the same kind of installation method.
★问题描述:
节日快到了,班长给大家准备了 M 个同样的礼物。 由于礼物太多,不好携带,因此他
准备将 M 个礼物装到 N 个相同的塑料袋中(允许有塑料袋空着)。
注意,如果 N=3, M=7,那么 5,1,1 的装法和 1,5,1 的装法算是同一种装法。-Gift allocation algorithm experiment of the problem ★ 2.3 Problem Descr iption: Festival is coming, we prepared the squad for the M same gift. Because too many gifts, not to carry, so he prepared a gift attached to the M N identical plastic bag (allow empty bags). Note that if N = 3, M = 7, then 5,1,1 and 1,5,1 installation method of installation method regarded as the same kind of installation method.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
说明.html