iec614

用贪心算法求解删数问题,贪心算法作为解决问题的一类重要方法，因其直观、高效的特点而受到重视-Deleted with the greedy algorithm to solve a few problems Abstract greedy algorithm to solve the problem as a class of important ways, because of its intuitive and efficient characteristics of attention.

最新的jboss信息。设计到有关的所有的配置使用信息。-new jboss information。

手机一卡多号实现-a phone card to achieve more,

这是我的个人作品，费了好大的力气呢，请多赐教。-This is my personal work, and a great effort it, I would like him to assume.

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

用VB编写的基于模糊数学原理的模糊识别程序，还有相应的例子-VB prepared based on fuzzy math theory of fuzzy identification procedures, and the corresponding example

保护模式下的80386及编程-protected mode and the 80,386 Programming

UNIX程式设计师手册第二版-UNIX programmers second edition of the Handbook

c++primer，很好的一本书，同学们现在找工作前都看这本书，有空看看，很好用-c++ primer, a good book, students are now looking for work before they look in this book, free look, a very good use

详细的面向对象java讲义，教会入门新手从不会到精通。以“零”为起点，从类和对象的概念入手，着重介绍java面向对象的程序设计方法……