6790966

关于unix系统的虚拟网络的connect部分功能，仅供参考，好好学习天天向上(unix virtual network)

实现通用的程序升级功能，可以检查是否有更新，下载更新(Achieve universal upgrade feature, you can check for updates, download updates)

4*4键盘控制1602液晶显示，希望对大家有用(4* 4 Keyboard control of liquid crystal display 1602, in the hope that useful)

非常重要的界面编程，很不容易编写出来的代码，可实现美化界面的作用，VC学习的好代码(aa)

hitbox bone tutorial

IOCP基本原理介绍，主要介绍了如何使用IOCP进行开发。(Introduce the basic principles of IOCP, mainly on how to use IOCP for development.)

实现计算器功能，还有漂亮的界面 ，使用VC6.0 mfc实现(calculator)

将TCHAR类型转换成CString类型，VC++精选编程学习源码，很好的参考资料。(The TCHAR CString type, VC++ select learning programming source code, a good reference.)

北大青鸟深入.NET,C#阶段测试，题目难度适中，适合初学者借鉴(Beida Jade Bird in depth. NET C# test phase, the subject of moderate difficulty, suitable for beginners to learn from)

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