MFC程序开发参考大全(人民邮电出版社)第一章源码

visual basic 经典技巧编程-值得一看-classic visual basic programming skills-eye-catcher

VB的特殊窗体效果的实现-VB forms of special effects to achieve

java与.net平台的架构比较，说明各自的特点，相似处，不同处，运行机制-java and. net platform architecture compared to illustrate their own characteristics, similarities, differences and operating mechanism

VC++图像编程的全部源码，很有用的，而且很好用的。-VC++ Image of all-source programming, useful, and well used.

c++课程设计，他适合c++出血者的一些事例，希望他对c++爱好者有帮助！-c curriculum design, he c bleeding for a few examples, I hope he is right c lovers!

自己编写实现的一类C算法集。帮助使用者更快的进入编程环节。使用方便-I have written to achieve a class C algorithms. Help users faster access to programming links. Easy to use

在一个划分成网格的操场上，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程序设计教程》电子教案.rar-"Java Programming Guide" electronic templates. Rar

深入理解UMTS无线网络－模式、规划与自动优化。-John.Wiley.and.Sons. Understanding.UMTS.Radio.Network.Modelling.Planning.and.Automated.Optimisation.

华为计算机公司的面试题目-Huawei Computer interview subject