sql操作代码，非常好用

vc++课程设计及面向对象程序设计-vc curriculum design and object-oriented programming

vc用驱动接口开发的,可以禁用usb,光驱,软驱,可以作为动态库使用.-vc-driven interface with development, you can disable the usb, drive, floppy drive, you can use as a dynamic library.

IE右键扩展(列出Flash）-IE extension (listed Flash)

这个是一个将如何利用C#产生随机密码字符串的代码，希望大家交流啊・-This is a how to use C# generate a random password string of code, hope that the exchange of ah

VB编写的各种按钮样式集合，可以丰富软件界面-VB prepared in a variety of button styles set, you can enrich the software interface

实现通讯录的录入、删除和添加系统。。模拟手机的通讯录管理程序-The realization of the address book entry, delete, and add the system. . Analog mobile phone address book management procedures

一个Java五子棋游戏，可以下了，判断输赢，几个按钮的功能实现界面的处理，等等就是功能完善-A Java Gobang game, one can make, and determine winners and losers, a few button function realization interface processing, and so is a fully functional Hehe

有n个整数，使其前面各数顺序向后移m个位置，最后m个数变成最前面的m个数-There are integers n, the number of its previous order of the backward shift position m, and finally the number m of m into the top of the number of

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

介绍了线程交互编成，写的还可以，有需要的同僚可以看看.-Introduced into the interactive thread, can also be written, there is a need to look at colleagues.