-
vendorSample
usbtrace dll c making sample
- 2015-04-25 05:06:32下载
- 积分：1
-
xdrj
易语言写的杀毒软件...............(Easy language to write anti-virus software ...............)
- 2009-12-13 12:00:05下载
- 积分：1
-
load_Sys
说明： 驱动程序加载卸载工具 编写RootKit加载驱动程序的测试工具 自己写的(Driver loading and unloading tools prepared RootKit driver load testing tool wrote it myself)
- 2008-10-02 12:55:44下载
- 积分：1
-
Ex1_02
VC 入门字符串的用法，示范了在纯C++中字符串的输出及换行的方法。(Introduction to string VC usage, demonstrated in pure C++, the output of the string and wrap method.)
- 2011-08-03 00:57:26下载
- 积分：1
-
aec_nlms_dsp
e4改进NLMS算法的回声消除器研究与DSP实现，挺不错的一篇论文(aec)
- 2010-07-20 11:03:31下载
- 积分：1
-
gen_demo
a code generation framework implemented in Ruby that attempts to go beyond the classic substitution of variables in templates
- 2013-10-25 09:41:43下载
- 积分：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
-
Skinmesh
实现骨骼动画类，实现简单骨骼动画载入鸡演示(Category to achieve skeletal animation, skeleton animation simple loading)
- 2009-07-09 19:56:44下载
- 积分：1
-
poly
一个简单的poly实系数一元项式问题的一个简单的解法,希望对大家有帮助!(A simple coefficient of poly is a dollar-type problem of a simple solution, and they hope to help everyone!)
- 2008-04-18 10:21:35下载
- 积分：1
-
Wordend
一个类似word的排版软件一个类似word的排版软件一个类似word的排版软件
- 2009-06-16 10:01:37下载
- 积分：1
