Camera_EXG50_GigE

Воронежский гос университет, задача по сям

说明：  在mfc单文档下的p程序 通过碰撞检测实现了模型的抓捕(Mfc Single Document in p under the collision detection procedure realize the model to capture)

说明：  从专业设备上读取数据图像，并对其进行分析的代码。(from professional equipment to read data from images and analysis of its code.)

template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)

基本7022芯片的抄表测试程序.代码与抄表终端一致(Basic 7022 chip meter test procedure. Code consistent with the meter reading terminal)

包括汉诺塔、杨辉三角、求根值等c程序，在VC++6.0运行没问题。(Including the Tower of Hanoi, Yang Hui triangle, the value of such c rooting process running in VC++6.0 no problem.)

控制台下的字符串管理程序，并且带有好看的节面（使用其他人的库）(String under the console management program, and with a good-looking face of the section (using other people s libraries))

设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中容器和游标的使用，一个简单的例子。。(VC cursor in the containers and the use of a simple example. .)

to check the user has the administration rights is more complicated in windows 7, this is the sample to check it.