利用VC实现的求最小公约数,任意输入两个数即可得到您要的结果...

Routines for computation of Weber s parabolic cylinder functions and their derivatives are provided for both moderate and great values of the argument. Standard, real solutions are considered. Tables of values are included. -Routines for computation of Weber s parabolic cylinder functions and their derivatives are provided for both moderate and great values of the argument. Standard, real solutions are considered. Tables of values are included.

应用背景数据库的还原备份操作，开发工具vs2008 ,使用数据SQLServer2005关键技术C# 、SQLServer2005、INi文件操作、数据库基本操作、封装

使用C++设计俄罗斯方块游戏，游戏有两种模式，一种是玩家模式，另一各是机器自主模式。在自主模式中，使用AI算法设计俄罗斯方块游戏的玩法。

WinCvs2_0_2的源代码，windows版的CVS客户端，能够编译-source code for WinCvs 2.0.2. It is the CVS windows client. you can download it and complible it directly.

基于VC++，各种复选框很好的应用于多功能计算器-Based on VC++, a variety of very good applies to multi-box calculator

用EVC编写一个可运行于Wince5.0的应用程序,不错哦-EVC can be used to prepare an application that runs on Wince5.0, yes oh

一种基于分类算法的网页信息提取方法.pdf-A Method of Web Information Extraction Based on Classification Algorithm.

三本经典的电路高速设计，被国外视为高速 设计的宝典-3 classic high-speed circuit design, has been regarded as a high-speed design abroad Baodian

window graph

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