上三角矩阵压缩存储类，用c++描写的，数据结构中的

模仿大自然草的运动。用DX9编写，用泰勒公式逼近-mimic natural grass movement. With DX9 prepared with Taylor approximation formula

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

颜色模式下雾中茶壶-color mode teapot Mist

死锁的程序演示 用信号量实现的-the procedures used to demonstrate signal to achieve the volume

xvbxhbxfcbcfbcbcvb x b -xvbxhbxfcbcfbcbcvb x

一个课程设计，数据结构的， 1）设计题目 2）设计目的 3）设计内容 4）程序流程图 5）源程序 6）软件测试报告（包括所用到的数据及结果）-a curriculum design, data structure, 1) a design 2), designed to 3) design element 4) Flow chart 5) source 6) software test reports (including use of the data and results)

在 VC下，使按钮不加载资源图片，而是让用户选择自己的图片加载在按牛表面上。-in VC, so the button is not loaded Photo resources, but allow users to choose their own pictures by cattle loaded on the surface.

用VC编的小游戏程序,能给大家参考,谢谢你们使用,多多帮助我,互相学习.-VC series of small game procedures, give your reference, thank you for your use, give more to help me, to learn from each other.

用于mpeg4解码的源代码-mpeg4 codec for the source code

430的149的timer功能使用源码，测试通过-430code