c++程序设计教材主要介绍c++程序设计的方法技巧和注意方面

vc技术内幕第五版 是CHM格式的 英文原版 非常值得收藏-vc technology insider CHM format is the fifth edition of the original English very worthwhile collection

Visual FoxPro 6.0程序设计教程电子教案-Visual FoxPro 6.0 Programming tutorial e-lesson plans

阐述了breaking在C语言中的用法！-On breaking in the C language usage!

很常见的N皇后问题，用矩阵的形式画除图， 1表示皇后的位置-Very common N-Queens problem, a matrix in the form of paintings, inter diagram 1 that the location of the Queen

Beginning CSharp Game Programming (Premier, 2005) by Tantanoid.pdf

JAVA 2平台安全技术-结构,API设计和实现-Java 2 Platform security-structure, API Design and Implementation

C in a Nutshell is the perfect companion to K&R, and destined to be the most reached-for reference on your desk.-C in a Nutshell is the perfect companion to K

3维CAD模型局部结构算法 对于学习3D模型算法很好的论文 希望大家多学习学习-3-D CAD model of local structure learning algorithm for 3D model algorithm good papers hope that we learn more

在21天内自学Visual C++ 6

背包问题动态规划算法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.