SWING bread is an important JAVA kits, how to make good use of this type of pack...

侯俊杰，《深入浅出MFC》简体中文版(附源码)-Hou Junjie, " visitors to learn MFC" Simplified Chinese version (with source code)

三星sdram操作手册,大家有兴趣-Samsung Manual sdram, we are interested in to see !!!!!

非常好的一本Photoshop教程电子书，很基础，浅显易懂-A very good Photoshop tutorial e-book, it is the basis for easy to understand

有关C语言头文件的资料汇总 有详细的介绍各个头文件-On the C language header file information aggregation are described in detail the various header files

Qt4源代码,详细介绍了Qt4编程中的范例-QT4 source code, detailed programming examples of Qt 4

一本十分好的VC++教程，个人觉得十分有益，对于初学者和需要提高自己的编程人员有很好的借鉴意义。-A very good VC++ tutorial, individuals find it very useful for beginners and the need to improve their own programming staff has a very good reference.

“This book is a tremendous achievement. You owe it to yourself to have a copy on your shelf. The chapter on iostreams is the most comprehensive and understandable treatment of that subject I’ve seen to date.”-" This book is a tremendous achievement. You owe it to yourself to have a copy on your shelf. The chapter on iostreams is the most comprehensive and understandable treatment of that subject I" ve seen to date."

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

softice book

“8020”法则是当今社会流行的规则。如果你想成为成功人士就一定要读一读。- "8,020" the principle is now the social popular rule. If you want to become the successful public figure certainly to have to read.