c语言高级编程技术 学习C语言的一本好书！

hibernate_reference.pdf hibernate学习文档，包含hibernate所有要点。-hibernate_reference.pdf hibernate study document that contains all the elements of hibernate.

visual c++编程实例mfc-visual programming examples mfc

是ITAT的考试题目，希望大家一起互相研究-ITAT examination is the subject of study of hope that we together with each other

一个木子美的电子书籍-a Mu Zimei electronic books

c语言入门教程，可以供不太熟悉的人查阅使用-Guide, for people not familiar with the use of inspection

一本Internet java书籍．讲解在Internet上的java应用教程-An Internet java books. On the Internet applications on the java tutorial

在一个划分成网格的操场上，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.

C语言面试题总汇,C程序员重要面试问题及解答，值得一看。-C-face questions confluence, C programmers important interview questions and answers, worth a visit.

VC._NET开发驱动程序详解，2002开发人员宝典系列-VC._NET Driver Comments on the development, developers 2002 book series

基于VRML-Java的虚拟装配系统开发-Development of Virtual Assembly System Based on VRML-Java