-
Andciv-Q-A-13.927
andciv 3d printer 控制板常见问题汇总(andciv 3D printer control board QA)
- 2013-10-24 09:38:32下载
- 积分:1
-
ms_icmp
又一个使用ICMP.DLL实现ping的小例子 (Another example of using ICMP.DLL to implement ping)
- 2021-02-05 10:39:57下载
- 积分:1
-
src
restores the SDT. an example in c++
- 2009-07-10 22:14:45下载
- 积分:1
-
ReceiveMessageer
接收系统消息不示例,可以提供初学者使用.(receive system message demon .using VC++)
- 2012-12-09 18:01:17下载
- 积分:1
-
judge
这个程序实现的是素数判别,里边包含两个文件夹(This program is a prime Discriminant inside folder contains two)
- 2009-01-14 23:30:03下载
- 积分:1
-
VC_program_source_code_achieve_order_management_sy
VC实现订单管理系统程序源码VC program source code to achieve order management system(VC program source code to achieve order management system)
- 2010-08-13 20:32:12下载
- 积分:1
-
juyuwang
该程序简单介绍了如何创建局域网的C/S工作模式,简单可靠。(The simple procedure describes how to create LAN C/S mode, simple and reliable.)
- 2011-10-14 14:31:59下载
- 积分:1
-
comm
Windows串口编程 (Windows serial programming)
- 2020-06-30 11:20:02下载
- 积分: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
-
net
网络编程代码,包含UDP,TCP和NET的源码,每种都保护服务器端和客户端(Network programming code, including UDP, TCP and NET source code, each protected server and client)
- 2012-02-21 16:04:37下载
- 积分:1