Description: G n kinds of countries issued stamps of different denominations, and provides up to allow only affixed on each envelope m stamps. Continuous postage required for a given problem n and m values, given the nominal value of the stamp best design, makes it possible to start from postage 1 posted on an envelope, postage increments of the maximum continuous interval of 1. For example, when n = 5 and m = 4, the nominal value (1,3,11,15,32) can put five kinds of postage stamps postage maximum continuous interval is 1-70. Programming tasks: For a given positive integers m and n, calculate the optimal design of the stamp denominations.
To Search:
File list (Check if you may need any files):
ContinuousPostage\ContinuousPostage.vcproj
.................\ContinuousPostage.vcproj.wen-PC.wen.user
.................\Debug
.................\.....\BuildLog.htm
.................\main.cpp
ContinuousPostage
Download