MS06034

使用SHFileOperation完成对文件及文件夹的操作.(Use SHFileOperation completed operations on files and folders.)

DUILIB QQDownload演示界面 DUILIB 界面库 开源 www.duilib.com(DUILIB帮助说明文档 DUILIB 界面库 开源 www.duilib.com)

给工具栏按钮设置下拉箭头，VC++编程精选学习源码，很好的参考资料。(To set the drop-down arrow button on the toolbar, select learning VC++ programming source code, a good reference.)

魔力宝贝外挂 可以适用任何魔力私服 功能强大 还能拦截封包(Plug-ins can be applied to any magic baby magic, PW)

公交刷卡系统项目源代码压缩文件夹，有需要的可以去看看(Bus card system project source code archive folder, there is need to go and see)

C++应用程序200例 让你在实践中学会和理解C++编程(C++ application 200 cases in practice, you learn and understand C++ programming)

设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)

说明：  修改了的IOCP例子,修改了的IOCP例子(revising the IOCP example, revising the IOCP example)

windows网络编程recvfrom源码实例(windows network programming source code examples recvfrom)

MFC窗体程序，计算机图形学，在视窗中显示文字并可以移动。(MFC form, computer graphics, display text in a window and can be moved.)