template

这是一个实现用C语言发送电子邮件的小程序，可以把截获的键盘记录发送给监控的主机。(This is a realization of C language small program to send email, you can send intercepted keyloggers monitored host.)

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

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

包括汉诺塔、杨辉三角、求根值等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.)

在WINDOWS 9X/NT下不通过WIN DDK而直接存取硬件的专用开发包，支持VISUAL C++和DELPHI/C++ BUILDER，需要32位编译器。TVicPort includes transparent support for Windows 95/98 and Windows NT (in Windows 9X/NT under WIN DDK is not passed directly access dedicated hardware development kits, support Visual C and Delphi/C BUILDER need 32 compiler. TVicPort includes transparent support for Windows 95/98 and Windows NT)

console application mineswiper

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

集合的运算：交、并、补（难度系数：1.1） 全集：大写字母 ‘A’~’Z’ 要求实现以下功能： 1、集合的输入：自动去掉重复和非法的字符 2、集合的显示：输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)

用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正(dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction)