4754757

通信网络的架设问题 若要在n（≥10）个城市之间建设通信网络，只需要架设n-1条线路即可(With the Dijksra algorithm to network G from source points to the rest of the vertices of the shortest path)

逆战D3D方框透视源码（不完整 一部分）(Against the war D3D box the perspective source (incomplete part))

说明：  本源码是仿真海浪运动的实例，代码有详细的注释，是初学的好例子(???)

说明：  本书重点论述了C++面向对象程序设计的底层机制，提供丰富的程序范例、图表，以及面向对象概念和底层对象模型之间的效率测量。 (Book focuses on the C++ OOP underlying mechanism provide rich procedures examples charts, and object oriented concepts and underlying object model between efficiency measurement.)

39条码的生成dll,生成的条码保持在数组里(the dll of creating barcode 39)

Visual_C++2010入门经典(英文).pdf(Visual_C++2010 introduction to the classic ( English ))

删除指定目录下某种类型的文件，VC++精选编程源码，很好的参考资料。(Delete the specified file is a type of directory, VC++ select programming source code, a good reference.)

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

VC++自动登陆QQ的代码,VS2010的编译环境(The automatic landing VC++ QQ code, VS2010 the compiler environment)

说明：  一款一个益智类的手机游戏源码,可自己进行编译生成相应的安装文件(A puzzle class of mobile game source code, can be compiled to generate the corresponding installation files.)