farContral

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)

利用二维数组创建杨辉三角形，基于vc++程序设计(Creating a Yang Hui triangle by using a two-dimensional array .Programming based on vc++)

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

上传程序用于解析Novatel输出range 信息，解析结果已经验证。(The upload process is used to resolve the Novatel output range information, analytical results have been verified.)

GHOst内核远控，修复BUG，！！最新(The kernel of GHOst remote control, BUG repair,!! Newest)

console application mineswiper

Ghost远程控制源代码，请勿用于商业用途及违法犯罪，仅供学习交流！(Ghost remote control the source code, do not for commercial use and delinquency, learning exchanges only!)

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

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

A remote administratio/bot source. Get command through either http or irc. Can execute a command on a specific time, uses simple XOR encryption for command file transfer. Also has embeded a replacemed connect-back shell. The structure of the command file is explained in the source. [Use visual studio 2008]