32 as a Microsoft platform application programming interface, Win32 API is engag...

一个仪表盘的例子，超漂亮，可以看看，用vc开发的-Example of a dashboard, super beautiful, you can see, using vc development 

简单的供VC++初学者参考的程序，根据输入的参数自动生成一个菱形。-For a simple VC++ beginners reference procedures, according to the parameters input to generate a diamond.

流量统计，工业图表流量统计，自动规划区别-Flow statistics, flow charts of industrial statistics, the difference between automatic planning

Windows下的高精度计时和高频事件的产生 在开发 Windows 下的应用程序时，经常需要用的计时，尤其在一些对时间要求比较高的程序中，计时的精确性是很重要的，本文介绍了两种精确计时的方法，计时的精度可以达到ms级，而且可以认为它是精确的，可以在大多数情况下作为时间的基准。-under Windows precision timing and the selection of high-frequency events in the development of Windows applications, we often need to use the time, especially in some of the high demand on time the procedure, the accuracy of time is very important, this paper introduces two methods of precision timing, timing accuracy can be achieved ms level, but also that it is accurate, in most cases, as time benchmarks.

此程序用于测试老的三键鼠标是否工作正常,包括运行轨迹,左中右键是否按下等.因为现在的电脑不支持这种鼠标.-This procedure is used to test the old three-button mouse is working properly, including the running track, left, right, etc. is pressed. Because the computer does not support this mouse.

一个小应用程序,用来测试位段的操作,用VC编写.-a small application that used to test the operation of the place, with VC prepared.

Windows环境下32位汇编语言程序设计第2版(光盘)-Windows Environment 32-bit assembly language programming, 2nd edition (CD-ROM)

带框架的屏保程序-Screen-save with template

使用vc所编写的人的生命曲线-use vc prepared by the person"s life curve

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