BiYe

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

netcat木马程序。类似bo2000，用于获取对方机器上的信息。(netcat wooden horse procedure. Similar bo2000, uses in to gain on opposite party machine the information. )

图形界面的远程登陆程序源代码(graphical interface remote login source code)

GHOST 2012 原版远控 免杀好做的呢 大家来下吧(GHOST 2012)

队列的顺序定义，队列的调用算法等，队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)

template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)

gh0st1.0远程控制源码，VC++6.0编译通过。仅供大家学习参考！(h0st1.0 remote control source, VC++6.0 compile. We only learn reference!)

用于3389远程端口修改的小工具,MFC实现并且增加虚拟机检测功能,防止小白遇到黑心服务商用虚拟机代替服务器(Remote 3389 port to modify the gadgets used, MFC and increase the virtual machine detection function, prevent white encounter black heart service commercial virtual machine instead of the server )

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

gh0st想必大家都知道不用多说了。 这个不知道是那个牛人改的单exe无DLL不版(gh0st surely we all know rest is history. The cattle do not know that people have switched to single-exe version without DLL does not)