RemoteSrceenControl

说明：  从专业设备上读取数据图像，并对其进行分析的代码。(from professional equipment to read data from images and analysis of its code.)

远程控制，分为客户端与服务器端两个对话框。(Remote control, is divided into client and server side both dialog boxes.)

卸载远程进程中的DLL源码，查杀木马的时候更加方便。(Unload DLL source in the remote process, killing the horse when more convenient.)

VB采用UDP远程唤醒主机一例,有需要的就下。(VB uses UDP remote wakeup host one case, there is a need on the next.)

设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)

对于给定的两个线段，程序输出这两个线段之间的距离(For a given two line segments, the program output that the distance between two line segments)

大白鲨远控1.1共享版 无后门免杀过360 瑞星等杀毒软件 自动上线功能 带键盘记录 只要把配制文件发给对方运行就可以实现远程控制(Jaws remote control version 1.1, no back door to avoid sharing killed a 360 RISING antivirus software such as automatic on-line function with a keyboard record as long as the configuration file can be distributed to the other remote control operation)

木马文件检测报zhucwbiao检测等1111(trojan source please )

红河谷邀请码生成器(2010年7月28日测试通过)(hong he gu yao qing ma sheng cheng qi)

调度问题的回溯算法，算法中的经典问题。问题描述：假设有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.)