caobiao

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

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

求解符号三角形问题.给定一行符号(比如+和-),按照同号为+异号为-的原则计算第二行直至下面的行,最后的一行只有一个符号,要求统计各个符号的个数.(Problem solving triangle symbols. Given his symbols (such as+ And-), in accordance with the same number is+ Different number- the principle of calculation of the second line until the following line, the last line there is only one symbol, all symbols requested statistics number.)

hangle unicode used AI

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

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

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

使用哈弗曼编码技术进行数据压缩和解压缩，缺点在于只能用于文本(Havermann coding techniques using data compression and decompression, disadvantage is that the text can only be used)

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

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