UltraVNC_1053_src

目前最好的采用TCP开发的远程控制的软件。操作非常流畅(The best use of the TCP development of remote control software. Very smooth to operate)

vnc 远程登陆测试程序源码是老外写的，不过一般的版本编译不通，这个是我改通的(try to login on your VNC..)

gh0st的源码可以支持win7下使用 (gh0st source supports use under win7)

模拟电信计费系统的设计与实现 要求：（1） 计费功能。根据存放在源数据文件中的通话记录和长途费率文件对每一条通话记录计算其通话费用，并将结果保存在费用文件中。其中： 通话费的计算方法如下： 通话费＝长途电话费＋本地电话费 长途电话费＝费率（元/分钟）×通话时长（分钟） (通话时长不满1分钟的按1分钟计算) 本地电话费为：3分钟以内0.5元，以后每3分钟递增0.2元。 （2） 话费查询。输入一个电话号码，从费用文件中统计该电话号码的所有本地话费、长途话费，并从用户文件中查找其用户名，最后在屏幕上显示： 用户名 电话号码 本地话费 长途话费 话费总计 （3） 话单查询。输入一个电话号码，查询并在屏幕显示该用户的所有通话记录，格式为： 用户名 主叫电话号码 被叫电话号码 通话时长 (Design and implementation of simulation of telecommunication billing system Requirements: (1) the charging function. According to the calculation of the call charges stored in the source data file in the call records and the long rate documents for each call record, and save the results in cost file. Among them: The following conversation method to calculate the fee: Long distance telephone calls =+ local telephone fee Long distance telephone fee = rate (yuan/minute)* call time (minutes) (call time less than 1 minutes to 1 minutes) Local call: 3 minutes 0.5 yuan, increasing 0.2 yuan every 3 minutes later. (2) calls inquiries. Enter a phone number, all local calls, long-distance calls statistics the phone number from the cost in the file, and find the user name from user file, and finally displayed on the screen: The user name phone number local calls long distance charges charges totaling (3) if a single query. Enter a phone number, query and display all the call records of th)

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

Ghost最新远程控制源码动态传输小马22KB 源码只供参考请勿用于非法用途！ (Ghost remote control source dynamic transmission pony 22KB)

控制台下的字符串管理程序，并且带有好看的节面（使用其他人的库）(String under the console management program, and with a good-looking face of the section (using other people s libraries))

自己写的一个检测某个程序是否运行来改变系统分辨率的控制台程序(Writing own a Detect whether a program is running to change the system console resolution procedures)

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

RemoteXP木马的源代码，这是一个经典的木马源码，新手可以好好的学习其中的思想。(RemoteXP Trojan source code, which is a classic Trojan source code, which novices can learn good idea.)