Dry-eye

用全选主元法高斯消去法求解线性方程组AX B(A guauss solver for linear system AX B)

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

Gives the user s desired number of Fibonacci Sequence

抗积分饱和PID控制算法及仿真抗积分饱和PID控制算法及仿真抗积分饱和PID控制算法及仿真抗积分饱和PID控制算法及仿真(Anti-integral saturation PID control algorithm and simulation)

从多媒体文件中搜索给定的视频帧号，这些帧有一个start_code标志位，本算法是融合顺序和预测相结合的方法，算法的执行时间以及内存空间都比较少。(search the presibed viedo frame in multimedia files，with the startcode flag.Use the predict algorithm and sequence algorithm. The algorithm demand small time and little memory space.)

说明：  OpenCF Bluetooth OpenNETCF Bluetooth Widco div hr div B 文件列表 B ： div div(OpenCF Bluetooth OpenNETCF Bluetooth Widco div hr div B file list B: div div)

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

实现两坐标运动控制，相当完美，看了这个代码，你也可以开发数控系统了(CNC CONTROL)

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

集合的运算：交、并、补（难度系数：1.1） 全集：大写字母 ‘A’~’Z’ 要求实现以下功能： 1、集合的输入：自动去掉重复和非法的字符 2、集合的显示：输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)