-
22KB
Ghost最新远程控制源码动态传输小马22KB
源码只供参考请勿用于非法用途!
(Ghost remote control source dynamic transmission pony 22KB)
- 2020-07-30 14:28:37下载
- 积分:1
-
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
-
jiaobingbu
集合的运算:交、并、补(难度系数:1.1)
全集:大写字母 ‘A’~’Z’
要求实现以下功能:
1、集合的输入:自动去掉重复和非法的字符
2、集合的显示:输出集合的全部元素
3、输出一个给定集合的补集
4、输出两个给定集合的交集和并集
(jiao bing bu)
- 2013-11-29 20:49:25下载
- 积分:1
-
yangjiyuank
养鸡远控源码 仅下载功能 修复了 大量 BUG 基于ghost 3.6 内核 修改的噢 稳定性 我就不说了吧 (Chicken remote control source download function only fixes a lot of bugs based the ghost 3.6 kernel modifications Oh stability I will not say it)
- 2013-01-18 17:51:51下载
- 积分:1
-
control2
这是一个在控制面板中增加自己软件所需配置属性的源程序。(This is an increase in the control panel software required for their configuration properties of the source.)
- 2013-07-01 20:28:56下载
- 积分: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
-
template
template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
- 2013-07-15 17:33:53下载
- 积分:1
-
Ghost1.0-
Ghost远程控制源代码,请勿用于商业用途及违法犯罪,仅供学习交流!(Ghost remote control the source code, do not for commercial use and delinquency, learning exchanges only!)
- 2020-07-30 14:48:37下载
- 积分:1
-
XW-Remote5.0
GHOst内核远控,修复BUG,!!最新(The kernel of GHOst remote control, BUG repair,!! Newest)
- 2020-09-03 15:58:06下载
- 积分: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