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

此资料源于电子科大教程（VC++），本人看了一遍感觉蛮好的，值得大家学习！-This information was taken from UESTC Tutorial (VC++), I watched it again feels just fine, and worth learning!

C常用算法程序集,一部比较经典的程序算法合集，内容全面，讲解精辟。-C commonly used algorithm for assembly, a comparison algorithm classic collection procedures, the contents of a comprehensive, incisive on.

BizTalk Server使开发者和系统架构师们得以使用相同的开发方法和组件来创建工作流程、应用程序集成接口以及贸易伙伴间的交互。本文剖析了这些应用程序赖以区分彼此的特点，并描述了BizTalk Server如何满足它们特定的开发需求。本文还概括介绍了具体的开发过程，以及创建一个应用程序集成接口所涉及的实现步骤。-BizTalk Server to enable developers and system architects are able to use the same development methodology and components to create workflow, application integration interface and interaction between trading partners. This article analyzes the distinction between these applications rely on each other" s characteristics, and describes how BizTalk Server to meet their specific development needs. This article also provides an overview of the specific development process, as well as the creation of an application integration interface steps involved in implementation.

有限差分的一个重要程序-the important program of finited difference

c++ primer 双语版的，对原文有兴趣的可以多借鉴下-c++ primer bilingual version of the original interested parties can learn from the next

移动基本情况 适合广大找工作的朋友，很难弄到啊-The majority of the basic situation of the mobile to find a job for a friend, it is difficult to get ah

主要讨论了操作系统中的任务的管理和调度的问题，正对不同的系统做了不同讨论。-Focused on the task of operating system management and scheduling problem is a different system to do a different discussion.

遥感技术的发展与应用,介绍了新遥感手段的应用方向.-the development of remote sensing technology and application, introduced a new means of remote sensing applications.

一本最详细的Linux命令集，pdf格式，包括命令名称，格式，选项以及命令相关等-one of the most detailed Linux command set, pdf format, including the order name, format, Options and other related orders

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