1．在选择装入背包的物品时，对每种物品I只有两种选择，即装入背包或不装入背包。不能将物品I装入背包多次，也不能只装入部分的物品I。 2．物品的种数，重量、价...

简单的中国象棋游戏源代码 适合从c＋＋初学者学习-simple Chinese chess game for the source code from C++ beginners learning

基于51单片机的1602显示的时钟c语言程序及汇编程序-51 Based on the 1602 single-chip clock shows and compilation procedures c language program

动态规划解决0-1背包问题-0-1 knapsack problem

简单密码输入框 简单密码输入框 -simple password input box si mple password input box si mple password input box SR single password input box

在MATLAB下实现了图像的方块编码功能-Achieve the image in the MATLAB code in the box functionality

F2812 FLASH烧写软件，大家都来看看哦-F2812 FLASH programmer software, we all look at看哦

php的源代码，里面的内容很丰富哦！希望对大家有用！-php source code, which covers a wide range Oh! Hope for all of us!

这好似一个很实用的一堆软件，大家，拿去用功相互借鉴。-This is a very practical like a pile of software, U.S., instead learn from each other hard.

邮票问题:设一国家发行n种不同面值的邮票，并且每封信至多允许贴m张邮票，对于给定的m,n值，写一个算法求出从邮资1开始在增量为一的情况下可能获得的邮资值的最大连续区域以及获得这个区域的各种可能面值的集合。如，当 n=4,m=5,若有面值为（1，4，12，21）的四种邮票，则邮资最大的连续区域为1到71。还有其他面值的四种邮票可组成同样大小的区域吗-stamp issue : Let a national issue n different denominations of the stamps and letters each allow up to m stamp affixed, to the m, n, write an algorithm derived from a postage in an increment of the circumstances, may obtain a postage value of the maximum continuous access to this region and regional various denominations could assemble. For example, when n = 4, m = 5, if the values of (1,4,12,21) of the four stamps, postage largest regional consecutive 1-71. There are four other denominations of the stamps can be the same size as the composition of the region? ?

Knuth的快速模式匹配算法改良，可以匹配含通配符？和*的标准串-the rapid improvement of pattern matching algorithm can match with wildcards?* And the standard Series