-
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
-
SETFTIME
我在上个世纪写的一个批量修改文件时间属性的精致实用小程序，在Windows下可用（开发环境：DOS,BC3.1）。
(I write in the last century, a batch of time to modify the file property of the exquisite small practical procedures can be used under Windows [Development Environment: DOS, BC3.1].)
- 2021-03-01 15:39:34下载
- 积分：1
-
Desktop
调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
- 2010-02-19 23:31:11下载
- 积分：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
-
窗口震动
对控制台窗口操作进行抖动，通过窗口句柄找到控制台窗口，通过快速移动窗口位置实现抖动效果(The operation of the console window is jittered, the console window is found by the window handle, and the jitter effect is achieved by moving the window position quickly.)
- 2019-05-02 00:38:53下载
- 积分：1
-
Queue
队列的顺序定义，队列的调用算法等，队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)
- 2013-07-17 15:42:54下载
- 积分：1
-
TL
说明： 易语言天龙八部 控制台与dll之间的通讯例程 调用的是易语言的支持库(Easy language between the console and DLL communication routines call the language is easy to support the library)
- 2016-12-31 16:54:19下载
- 积分：1
-
codlwhqchsource
这是基于systemview平台的cdma下行链路仿真源码, 能满足cdma开发过程中的仿真需要,(This is the cdma downlink simulation source code based on systemview platform, which can meet the simulation needs in the cdma development process.)
- 2019-01-05 07:37: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
-
Camera_EXG50_GigE
Initialise and acquisition of Camera EXG50 GigE
- 2011-12-20 17:32:53下载
- 积分：1
