文件名称:stamp
介绍说明－－下载内容均来自于网络，请自行研究使用
邮票问题背景：设想一个国家发行n种不同面值的邮票，并假定每封信上至多只允许贴m张邮票，对于给定的m和n值，写一个算法求出从邮资1开始在增量为1的情况下可能获得的邮资值的最大连续区域以及获得此区域的各种可能面值的集合。-Background Stamp: n idea of a national issue of stamps of different denominations, and each letter on the assumption that only allows a maximum of stamps affixed to m, for a given value of m and n, write an algorithm derived from the one started in the incremental postage circumstances for one of the postage value may be the largest continuous region, as well as access to this region, a collection of all possible face value.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
可执行程序
..........\Project1.exe
文档
....\邮票问题实验报告.doc
源程序
......\Project1.bpr
......\Project1.cpp
......\Project1.res
......\stamp.cpp
......\stamp.h
......\Unit1.cpp
......\Unit1.dfm
......\Unit1.h
......\Unit2.cpp
......\Unit2.dfm
......\Unit2.h
......\Unit3.cpp
......\Unit3.h
......\Unit4.cpp
......\Unit4.dfm
......\Unit4.h
......\Unit5.cpp
......\Unit5.h
......\Unit6.cpp
......\Unit6.h
......\Unit7.cpp
......\Unit7.h
..........\Project1.exe
文档
....\邮票问题实验报告.doc
源程序
......\Project1.bpr
......\Project1.cpp
......\Project1.res
......\stamp.cpp
......\stamp.h
......\Unit1.cpp
......\Unit1.dfm
......\Unit1.h
......\Unit2.cpp
......\Unit2.dfm
......\Unit2.h
......\Unit3.cpp
......\Unit3.h
......\Unit4.cpp
......\Unit4.dfm
......\Unit4.h
......\Unit5.cpp
......\Unit5.h
......\Unit6.cpp
......\Unit6.h
......\Unit7.cpp
......\Unit7.h