学生管理系统, 学生管理系统,

code -code

LINUX中文化资料大全-LINUX cultural information Daquan

学习MFC的好例子4-learning MFC good example 4

图像压缩，JPEG2000，图像抽取，感兴趣区域编码-Image compression, JPEG2000, image extraction, region of interest coding

Borland c++ bulder的文件操作总结-Borland c bulder document summing up operation

虹膜识别 -iris recognition Iris Recognition

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

深入java虚拟机第二版，非常好的一本书。-Java virtual machine, the second edition of in-depth, very good book.

linux 新手管理员手册(PDF)-Manual (PDF)

反汇编揭秘，反汇编的重要内容，有兴趣的可以-Disassembly Jie Mi, disassemble an important, interested can look at