51单片机C语言入门教程 单片机，C语言

详细介绍了在at91rm9200下进行u_boot移植的每个步骤-described in detail under u_boot at91rm9200 transplant each of the steps

学习j2ee设计模式的好书-learning design patterns creates books

挺好的,可以下载看看,在WINDOWS下使用的.绝对精华！宁可错杀，不可放过- Very good, may download has a look, uses under WINDOWS Absolute essence! Rather wrong kills, cannot let off

关于如何利用powerdesigner进行建模及逆向工程的电子文档资料.-powerdesigner on the use of modeling and reverse engineering of electronic documents and information.

深入浅出MFC 2e 学习MFC编程的书，讲的很深入。-Dissecting MFC

J2EE-完全参考手册.pdf,中文版，是学习J2EE的非常好的入门教材。-J2EE-complete reference manual. Pdf, the Chinese version is studying J2EE very good introductory material.

44b0x详细文档

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

visual c++ source code for some graph formats (jpg, bmp)

naioijwefoj weojf王婆欧文而非奇偶wjopwefo -naioijwefojfojweojf fete Owen rather than parity wjopwefo