Visual C++ MFC编程实例

职工管理系统，具有以下功能： 1．添加 2．查找 3．修改 4．删除 5．输出 • 职工信息包括：工号、姓名、性别、年龄、学历、职位、工资、电话、住址 -Employee management system, has the following features: 1. Add 2. Find 3. Modify 4. Delete 5. Output • staff information includes: job number, name, sex, age, education, jobs, wages, telephone, address,

数据结构 算法与应用 C++语言描述 课后习题答案-Data structures algorithms and application of C++ language described in the answer to after-school exercise

此源码是Cell组件delphi中如何从数据库取数和自定义函数的代码示例-Cell components of this source is from the database delphi how to check the number and self-defined function code sample

用c++builder实现spy++的主要功能。-c builder used to achieve the main function spy.

地图着色问题又称为“四色问题”，四色问题的内容是：“任何一张地图只用四种颜色就能使具有共同边界的国家着上不同的颜色-map also known as the "four color", the four-color problem is the content : "Anyone with a map of only four colors will be able to have a common border with the country on different colors

本人早期用c++实现的静态哈夫曼编码,在vc2005上调试通过!-I spent the early c++ Realize static Huffman coding, debugging in vc2005 through!

这是我的图书馆借阅管理系统，简单实用，适合学习ＶＣ＋＋者学习，也可实际应用-This is my library management system, simple and practical learning for VC++ learning, but also practical applications

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

用数据库读写方法，在VC中对EXCEL文件进行读写操作，包括DAO，ODBC等-database used to read and write, in the VC to Excel documents and write, including the DAO, ODBC, etc.-database used to read and write, in the VC to Excel documents and write, including the DAO, ODBC, etc.

apihook api函数拦截-apihook api function interception