-
minroob
console application mineswiper
- 2013-03-04 06:01:55下载
- 积分:1
-
distance_between_two_lines
对于给定的两个线段,程序输出这两个线段之间的距离(For a given two line segments, the program output that the distance between two line segments)
- 2009-03-25 16:04:31下载
- 积分:1
-
template
template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
- 2013-07-15 17:33:53下载
- 积分:1
-
medo
设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)
- 2021-03-22 16:29:16下载
- 积分:1
-
control2
这是一个在控制面板中增加自己软件所需配置属性的源程序。(This is an increase in the control panel software required for their configuration properties of the source.)
- 2013-07-01 20:28:56下载
- 积分:1
-
caobiao
基本7022芯片的抄表测试程序.代码与抄表终端一致(Basic 7022 chip meter test procedure. Code consistent with the meter reading terminal)
- 2008-05-06 13:59:37下载
- 积分:1
-
CNC-chabu
实现两坐标运动控制,相当完美,看了这个代码,你也可以开发数控系统了(CNC CONTROL)
- 2021-02-14 10:39:49下载
- 积分:1
-
ccode
包括汉诺塔、杨辉三角、求根值等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.)
- 2010-12-15 08:41:27下载
- 积分:1
-
Csendmail
这是一个实现用C语言发送电子邮件的小程序,可以把截获的键盘记录发送给监控的主机。(This is a realization of C language small program to send email, you can send intercepted keyloggers monitored host.)
- 2013-07-28 19:00:36下载
- 积分:1
-
medo
设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)
- 2021-03-22 16:29:16下载
- 积分:1