TDP （ TCP­ over­ UDP library ）：基于 UDP 协议之上实现 通用、可靠、高效的 TCP 协议...

讲解深入细致的C语言教程，希望对广大的编程爱好者有所帮助！-C explain the intensive language courses, want to help the broad masses of programming enthusiasts!

PHP 4完全中文手册-PHP 4 complete Chinese handbooks

程序员杂志2005年第11期 程序员杂志2005年第11期-programmers 2005 magazine article 11 programmers in 2005 magazine article 11

FX绝对位置控制,不用位置控制单元，实现绝对位置控制- AC servo motor motion control system

labview control and simulation-PC control and simulation

程序员面试宝典，为找软件工程师一类工作的人员所喜-Programmer interview canon software engineers to find the type of work the staff xi

在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成(x,y),(x+1,y),…,(x+n-1,y)。如何选择x 和y的值才能使士兵们以最少的总移动步数排成一列。 实验任务：计算使所有士兵排成一行需要的最少移动步数。-In a grid divided into the playground, n soldiers stood scattered on the grid points. Grid point by the integer coordinates (x, y) express. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any one grid point has only one soldier. In accordance with the officer s command, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+ 1, y), ..., (x+ N-1, y). How to choose x and y values to make the soldiers with the minimum of the total moves one line up. Experimental tasks: the calculation so that all the soldiers lined up his required minimum moves.

英文版DSP2407资料，对其功能进行了说明，供大家学习

More Exceptional C++ By Herb Sutter Publisher : Addison Wesley Pub Date : December 17, 2001 ISBN : 0-201-70434-X Pages : 304 -By Herb Sutter Publishe r : Addison Wesley Pub Date : December 17, 2001 ISBN : 0-201-70434-X Pages : 304

java编程思想（完全版）-thinking (full version)