cube的综述，讲述了超立方体及其变形的很多性质等

小木偶Win32汇编教学，整理后的离线网页版本。MASM32或TASM代码。-small puppet Win32 compilation teaching, putting the offline version. Between code or TASM.

VB实现的RTF软件-the RTF software

Box2D Box2d是一个很出名的2d物理引擎-Box2D Developed

一个简单的曲线显示例子，祝初学者马达成功。visual c-a simple example of the curve, I wish beginners Motor success. Visual c

一个做得还不错的科学型计算器！-had not done a good, scientific calculators!

操作系统的内存管理模拟，用C++编写，不是可视化界面，但是十分方便实用~-operating system memory management simulation, C preparation, not visual interface, but very convenient and practical ~

v、 hdl文件一个电子钟，只要请求动作就开始显示sw

水情自动测报系统软件 具有数据通讯采集、加工成为各类报表、报图，该系统VB6开发，系统含46个子功能，有功能帮助。-Regimen automatic forecasting system with data communication software collection, processing to become various types of statements, reportedly plans, VB6 development of the system, the system with 46 sub-functions, functional help.

这是22本关于VC++语言的经典图书，希望对大家能够有所帮助！-This is a 22 on the VC++ Language classic books, hope everyone can help!

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right