ext 3.0 英文api, 这是ext发布的最新版本,对使用ext的人很有参考价值...

中文Crystal Reports联机帮助-Chinese Crystal Reports Online Help

基于java和acess开发的药品管理系统,实现基本功能-java and acess the development of drug management system

是学习51单片机不可多得的电子教程，易学易懂，是电子计算机专业学生或电子爱好者学习必备书藉，请大家有趣收藏哟.-51 Microcontroller is a rare study of electronic tutorials, learn to understand is the computer or electronic enthusiasts students to learn essential books, please interesting collection yo.

cisco新版认证教材 第三版 对于准备考思科认证的同学们很有用处-new cisco certification test preparation materials for the third edition of Cisco certification students useful

< pc游戏编程（网络篇）>>源代码，总共15章，里面有比较详细地分析和说明，相信对大家有好处！这个是第二,八,十一章公用的代码gamelib.rar-> source code, a total of 15 chapters, which have a more detailed analysis and description, I believe everyone will benefit! This is the second, eight, eleven chapters common code gamelib.rar

Ajax onlamb material for ruby on rails

在symbian S60 3rd,开发后需要提交symbian sign认证，认证前需要根据此文章中的内容逐一进行测试，方可提交，否则可能会被打回。-in symbian S60 3rd, after the development of symbian need to sign certification Certification is needed under this article, the contents of each test can be presented, otherwise it will be beaten back.

杭电acm解题报告 详细解析2000-2099 适合acm初学者-acm of HDU

通过实现对 ANSI 的终端转义序列的支持.这个应用程序还更好地利用了 MIDP 的用户界面功能，并具有对用于用户输入的键盘和定制窗体的支持。您可以组合和匹配这些软件组建来为新的种类的网络意识（network-aware）移动应用程序提供基础。-through the realization of the right ANSI terminal escape sequences support. The application also to make better use of the MIDP user interface functions, and features for user input to the keyboard and Custom Window support. You can mix and match software to the formation of new types of network awareness (network-aware) mobile applications provide the infrastructure.

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