-
shiper
Воронежский гос университет, задача по сям
- 2009-10-11 01:30:49下载
- 积分：1
-
guiji
惯导系统轨迹生成器，能生成不同位置转动和舰船摇摆条件下的陀螺和加速度计数据，用于研究惯导系统(INS trajectory generator can generate different locations and ships swing conditions rotating gyroscope and accelerometer data, inertial navigation systems for research)
- 2013-08-29 09:49:03下载
- 积分：1
-
guiji
惯导系统轨迹生成器，能生成不同位置转动和舰船摇摆条件下的陀螺和加速度计数据，用于研究惯导系统(INS trajectory generator can generate different locations and ships swing conditions rotating gyroscope and accelerometer data, inertial navigation systems for research)
- 2013-08-29 09:49:03下载
- 积分：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
-
minroob
console application mineswiper
- 2013-03-04 06:01:55下载
- 积分：1
-
aPLib-1.01
this is the library to compress and decompress any file. I found it on Net
- 2010-09-10 19:25:46下载
- 积分：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
-
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
-
Hufferman
使用哈弗曼编码技术进行数据压缩和解压缩，缺点在于只能用于文本(Havermann coding techniques using data compression and decompression, disadvantage is that the text can only be used)
- 2010-01-03 19:23:10下载
- 积分：1
-
b64
base64 decoder to decode the original char from base64 encoded string(base64 decoder)
- 2009-07-17 11:03:47下载
- 积分：1
