write c with program to compute GPA of student.

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

一个用MFC DLL开发的日期函数库-a DLL with MFC"s date library

实现了VC环境下，单文档里面显示BMP图片的功能。-achieve the VC environment, the single BMP file photo shows inside the function.

C++编程实际例子!! C++编程实际例子!!C++编程实际例子-C++ Programming practical examples!! C++ Programming practical examples!! C++ Programming practical examples

hex edit control

DFA的“语言”是这个DFA接受的所有的串的集合。假设a1a2…an是输入符号序列，让这个DFA从初始状态q0开始运行。查询转移函数δ，比如说δ(q0,a1)=q1，以找出DFA在处理了第一个输入符号a1之后进入的状态。处理下一个输入符号a2，求δ(q1,a2)的值，假设这个状态是q2。以这种方式继续下去，找出状态q3,q4,…,qn，使得对每个i，δ(qi-1,ai)=qi。如果qn属于F，则接受输入a1a2…an，否则就“拒绝”。-DFA" s " language" is the DFA to accept all of the string collection. A1a2 ... an assumption is an input symbol sequence, so that the DFA into operation from the initial state q0. Look transfer function δ, say δ (q0, a1) = q1, in order to identify the DFA in dealing with the first input into the state after the symbol a1. To the next input symbol a2, seeking δ (q1, a2) values, assuming that this state is q2. Continue in this way to find out the state q3, q4, ..., qn, making for every i, δ (qi-1, ai) = qi. If qn belongs to F, then accept the input a1a2 ... an, otherwise, " refuse."

核心编程源代码，很牛的书的相关的源代码，很值得一看，看后受益匪浅，有时间的可以考虑-core programming source code, is the cattle related to the source code, is an eye-catcher, after reading the benefit of a time can be considered to see if

一个利用VB编写的FTP客户端程序,学习网络编程的朋友可以学习下.-VB prepared using an FTP client program, learning to learn network programming under a friend.

utouchpos系统提供新的和翻新的品牌价值销售点系统添加的硬件和软件的零售等行业领域广泛的组合，餐厅（包括坐下和柜台销售），美容院和钉杆，寄售店，露营地和购物系统。touchpos是一家领先的零售POS餐饮POS以及销售系统和销售点硬件点供货经验以及广泛的商业环境中的各个销售点终端和销售点设备。我们提供了大范围的标准化束围绕我们的零售，餐饮，美容美发，杂货，寄售和快餐给需要的客户。在这上面我们提供的个人物品等，条码扫描器，销售软件，现金抽屉，信用卡读卡器，液晶显示器，触摸屏显示器，顾客极显示器，收据打印机（热冲击），全向条形码扫描仪，磅秤和广泛的技术业务服务。

实现了一段字符是否为回文的判断《数据结构》-huiwen