搜索资源列表
youpiao
- 设有n种不同面值a1, a2,…, an的邮票，规定每封信最多贴m张邮票。对于给定的m，n，求出最大的邮资连续区间。-with different denominations a1, a2, ..., an stamps, each up to the letter m stamp affixed. For a given set of m, n, obtained the largest postage continuous inte
youpiao
- 设有n种不同面值a1, a2,…, an的邮票，规定每封信最多贴m张邮票。对于给定的m，n，求出最大的邮资连续区间。
youpiao
- 设有n种不同面值a1, a2,…, an的邮票，规定每封信最多贴m张邮票。对于给定的m，n，求出最大的邮资连续区间。-with different denominations a1, a2, ..., an stamps, each up to the letter m stamp affixed. For a given set of m, n, obtained the largest postage continuous inte
youpiao
- 设有n种不同面值a1, a2,…, an的邮票，规定每封信最多贴m张邮票。对于给定的m，n，求出最大的邮资连续区间。-With a face value of n different types a1, a2, ..., an of the stamps, each letter provides a maximum of m stamps affixed. For a given m, n, obtained the largest
youpiao
- 此程序是一个简单的邮票计算的程序，由C++代码写成，虽然简单，但希望对大家有所帮助！-This program is a simple procedure for the calculation of stamps, from C++ code is written in simple, but we want to help!
youpiao
- 递归方法求解邮票问题，VC++6.0编译通过，有运行结果-Recursive method to solve the issue of stamps, VC++6.0 to compile, with operating results
youpiao
- 使用vhdl语言设计自动售邮票机。用两个发光二极管分别模拟售出面值为6角和8角的邮票，购买者可以通过开关选择一种面值的邮票，灯亮时表示邮票售出。用开关分别模拟1角、5角和1元硬币投入，用发光二极管分别代表找回剩余的硬币。 -Using vhdl language design vending stamp machine. Sold two light-emitting diodes were simulated nominal va