21-8

使用单文档应用程序框架实现简单的屏幕绘图程序实例源码,很不错的vc源码，希望能对大家有所帮助(Single-document application framework to implement a simple screen drawing program source code examples, very good vc source, I hope you can help)

该程序为BMP图像处理，能够打开和存储任何一幅图像格式为BMP，特别适合初学者，仅供参考！(The program for BMP image processing, to open and store any image format for BMP, especially suitable for beginners, for reference purposes only!)

MFC框架下多文档对话框RibbonMDI源码MFC Multiple Document dialog box under the framework of RibbonMDI source(MFC Multiple Document dialog box under the framework of RibbonMDI source MFC Multiple Document dialog box under the framework of RibbonMDI source)

说明：  一个能知道你所想的程序，结果会令你出乎意料的惊奇，其实如果你用理智的态度去想想，你就会知道为什么，这个程序是在ＷＩＮＤＯＷＳ　ＸＰ下用Ｃ＋＋写的(A program that can know what you are thinking,and the result will suprise you very much,but if you think logically,you shall know why,this program is developed in WINDOWS XP using C++.)

用C++实现的网络驱动程序向导代码。可以简单的创建一个工作区，并从工程中选择一个类型作为客户应用(Implemented using C++ code for the network driver wizard. You can simply create a work zone and choose a type from the project as a client application)

窗口方式下域名解析，DNS域名解析系统。(Window mode, DNS, DNS domain name system.)

说明：  skin5.0 界面库,很不错的皮肤类，简单的一句代码就可以让你的程序更换皮肤(skin5.0 interface library, it is a good skin type, a simple code can make your skin replacement procedures)

通过directShow方式进行摄像头视频的抓取(DirectShow way through the video camera crawl)

雷达数据采集，日本urg-0.8包，采集2D数据，将雷达测出的长度信号转换成图形数据显示，库包里有C库以及c++库。((Radar data acquisition, Japan urg 0.8 package, 2 d data, the radar to measure the length of the signal into graphic data shows that there are C library and the library of C++ library package.))

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