文件名称:20070207
介绍说明－－下载内容均来自于网络，请自行研究使用
(邮票问题)
设想一个国家发行n种不同面值的邮票，并假定每封信上至多只允许贴m张邮票。对于给定的m和n值，写一个算法求出从邮资1开始在增量为1的情况下可能获得的邮资值的最大连续区域以及获得此区域的各种可能面值的组合。例如：对于n=4和m=5，若有面值为（1，4，12，21）的四种邮票，则邮资最大连续区域为1到71。还有其他面值的四种邮票可组合成同样大小的区域吗-(Stamps) envisaged a national issue of n different denominations of the stamps, and on the assumption that each letter on maximum allowed m stamp affixed. For a given set of values m and n, write an algorithm obtained from the beginning of a postage for an increment in the circumstances, may be the greatest value of the postage for regional as well as in this area of the face value of all possible combinations. For example : n = m = 4 and 5, if the values of (1,4,12,21) of the four stamps, Postage is the largest regional consecutive 1-71. There are other denominations in the four stamps can be combined into the same size of the region?
设想一个国家发行n种不同面值的邮票，并假定每封信上至多只允许贴m张邮票。对于给定的m和n值，写一个算法求出从邮资1开始在增量为1的情况下可能获得的邮资值的最大连续区域以及获得此区域的各种可能面值的组合。例如：对于n=4和m=5，若有面值为（1，4，12，21）的四种邮票，则邮资最大连续区域为1到71。还有其他面值的四种邮票可组合成同样大小的区域吗-(Stamps) envisaged a national issue of n different denominations of the stamps, and on the assumption that each letter on maximum allowed m stamp affixed. For a given set of values m and n, write an algorithm obtained from the beginning of a postage for an increment in the circumstances, may be the greatest value of the postage for regional as well as in this area of the face value of all possible combinations. For example : n = m = 4 and 5, if the values of (1,4,12,21) of the four stamps, Postage is the largest regional consecutive 1-71. There are other denominations in the four stamps can be combined into the same size of the region?
相关搜索： 5-101
(系统自动生成,下载前可以参看下载内容)
下载文件列表
可执行程序
..........\Project1.exe
..........\Project1.exe