Visual C 6.0 21

毕业论文中关于小型宾馆管理系统的详细设计毕 业论文中关于小型宾馆管理系统的详细设计-thesis on small guesthouses management system for the detailed design thesis on small guesthouses management s ystem for the detailed design

测试初级试题-看你具备一些基本的要素么，不错的文档。-Test Primary Questions- see you have some basic elements of Yao

visual c++ 6.0 mfc开发实例，是工程应用中的一本好书。-visual c++ 6.0 mfc development of examples of engineering applications is a good book.

C专家编程__Expert C Programming.pdf,很经典的一本讲解C语言的书籍。-Expert C Programming __Expert C Programming.pdf, is a classic book on the C language.

vhdl very good debug release vhdl very good debug release

一本超值讲解VBA开发的书籍，属于难得的AutoCad开二次开发。-an overvalued on VBA books, AutoCad is a rare open secondary development.

WindowsAPI大全，本书介绍VC车道API函数及用法

字符串操作是一个不小的主题,在标准C++中,string字符串类成为一个标准,之所以抛弃char*的字符串而选用C++标准程序库中的string类，是因为他和前者比较起来，不必担心内存是否足够、字符串长度等等，而且作为一个类出现，他集成的操作函数足以完成我们大多数情况下的需要. 下面我们首先从一些示例开始学习下string类的使用.-i nclude ＃i nclude using namespace std void main() {

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

有关JAVA的电子书籍对入门者有所帮助。-electronic books to help beginners.