本书是针对高职高专教学特点而编写的与《C语言教程》配套的上机实际训练用书...

如何提高自己的VC++开发水平-how to increase their level of development of the VC

Visual C++ MFC扩展编程实例，全书提供了大量VC的编程实例，旨在帮助读者较为全面地掌握VC编程知识、技巧和方法。-Visual C++ MFC extension of programming examples, the book provides a large number of VC programming examples to help readers grasp the VC more comprehensive programming knowledge, skills and methods.

图像处理的入门资料有很详细的注释,VC写的-image processing introductory information on a very detailed notes written by VC

在c++编程中常会在调试时候遇到很多麻烦，在这本书中或许可以帮你解决-In the Central Standing Committee, c++ programming experience in debugging a lot of trouble when, in this book may be able to help you solve

实现了一个计算器应用程序，介绍了对话框添加菜单，高级按钮控件，高级编辑控件，对话框的扩展功能等应用。-Realize a calculator application, introduction of the dialog box to add the menu, advanced button controls, a senior editor control extensions dialog applications.

创建flash网站傻瓜书。内容包括： * Build an interface with custom buttons and menus * Include animation and soundtracks * Dress up your text * Create tween animations * Create ActionScript objects * Test and publish your site -Create flash website fool book. Include:* Build an interface with custom buttons and menus* Include animation and soundtracks* Dress up your text* Create tween animations* Create ActionScript objects* Test and publish your site

湖南大学c++精品课程的ppt文档，里面详细介绍了c++的语法，对初学者来说最适合不过。-Hunan University, c++ Course in ppt document, which details the c++ syntax, most suitable for beginners.

Beyond The Cplusplus Standard Library - An Introduction To Boost-Beyond The Cplusplus Standard Library- An Introduction To Boost

汇编语言对于从事计算机底层应用的人来说太重要了，我们一般用的汇编语言仅限于windows平台，而对其它平台可能很少接触，这本书就是专门介绍Linux平台下的优秀书籍。-assembly language for application in the bottom of the computer people, very important. We generally use the assembly language is limited to windows platform, and on other platforms may not contact, This book is devoted to the Linux platform outstanding books.

0_1背包问题,回溯法解背包问题 0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一