-
CNC-chabu
实现两坐标运动控制，相当完美，看了这个代码，你也可以开发数控系统了(CNC CONTROL)
- 2021-02-14 10:39:49下载
- 积分：1
-
vgpicker
说明： 在mfc单文档下的p程序
通过碰撞检测实现了模型的抓捕(Mfc Single Document in p under the collision detection procedure realize the model to capture)
- 2008-09-25 15:54:50下载
- 积分：1
-
caobiao
基本7022芯片的抄表测试程序.代码与抄表终端一致(Basic 7022 chip meter test procedure. Code consistent with the meter reading terminal)
- 2008-05-06 13:59:37下载
- 积分：1
-
template
template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
- 2013-07-15 17:33:53下载
- 积分：1
-
rfidreader
rfid实例阅读程序，可实现超高频，高频，低频卡的读写(
rfid实例阅读程序，可实现超高频，高频，低频卡的读写
RFID instance reading program, you can achieve ultra high frequency, high frequency, low frequency card read and write)
- 2017-05-25 01:32:50下载
- 积分：1
-
MY_YangHuiTriangle
利用二维数组创建杨辉三角形，基于vc++程序设计(Creating a Yang Hui triangle by using a two-dimensional array .Programming based on vc++)
- 2018-01-03 22:40:15下载
- 积分：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
-
travelingsalesman
用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正(dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction)
- 2005-06-09 15:40:17下载
- 积分：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
-
tongxinlu
通信录源程序。调试环境为TC2.0或者3.0。运行这个程序需要tc提供的几个头文件。(Example source address book, or 3.0 debugging environment for TC2.0. Tc run the program needs to provide several header files.
)
- 2011-12-05 15:03:16下载
- 积分：1
