a simple game for RPG game, which is based on VC++ 7.0 plus Direct C7.0 language...

一款模仿360安全卫士的界面源码，基于winform开发，自定义界面和皮肤，有需要的朋友不要错过! 注意事项： 开发环境为Visual Studio 2013，使用.net 4.0开发。

用vc++实现的运动检测系统，供对研究运动检测方向的朋友参考！-vc used to achieve the motion detection system for the study of motion detection direction reference to a friend!

E统天下--织网梦 ...背景不同。Java是基于C++、面向计算机程序 设计...代替。 (2)JavaScript 源代码无须编译 嵌入HTML...则与之不同。Java的源代码必须进行编译,成为 存在...中的一部分,以一般的文本编辑器就可以连同HTML一... www.51foru.com/index008jsjc.htm 19K 2003-12-10 - 百度快照 C Java PHP Perl Python的程序代码美化工具使用 ...php) 一个速度很快的C/C++/Java源代码美化工具。 astyle比indent好在 有很多成套的的风格定义:ansi ...SLICKEDIT这种大型商业文本编辑器等。 解决:对于...==>网页选项==>HTML源代码选单里选择“使用下面... www.chedong.com/tech/indent_tools.html 14K 2005-3-3 - 百度快照 Jedit for Linux Source Code 源代码--eNet软件-world-- Netting dream ... different backgrounds. Java is based on the C-oriented computer programs designed to replace .... (2) do not have JavaScript compiler source code embedded in HTML ... is different. Java source code to be compiled, as exists ... a part of, in general text editor with HTML can be a ... www.51foru.com/index008jsjc.htm 19K 2003-12-10- Baidu snapshot C Java PHP Perl Python the code landscaping tools ... php), a fast C/C/Java source code for landscaping tools. Astyle than indent Fortunately, there are many sets of

发送电子邮件例子-E-mail examples

怎样划分宏块的一个完整程序，该程序对一般的视频序列都很有用-How divided macroblock of a complete program of general video sequences are very useful

一款专门用于伪彩色处理的软件，对色彩的处理划分的比较详细。已经调试过了！-A specialized treatment for pseudo-color software, color treatment for a more detailed breakdown. Have been debug!

比 Windows 自带的高级一点的计算器，能将整个表达式输入，然后求值。这个程序要求读者具备编译原理的一些知识-than Windows, bringing their senior point calculators, the entire expression input, and then evaluated. This procedure requires the reader has compiled some of the principles of knowledge

在线制作图片/贺卡-online production Photo/cards

Registry search tool

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