数据结构数据链的演示程序，包括一个简单的模板…

这个项目是8皇后与c++的编程和结构

Arp Ping on Windows, use winsock2.h

如何在界面中调用一个程序并返回运行结果-how to transfer a program and return the result in interface

曲线离散化算法实现，Douglas_Peucker算法。-Curve discretization algorithm, Douglas_Peucker algorithm.

通过该程序可以检测硬盘的各个分区的总容量、剩余容量-Through the program can detect the hard disk each partition the total capacity, remaining capacity

本程序在VC6.0平台实现。是函数模板的扩展，也是学习com+的实现基础。-the procedures in VC6.0 platform. Template function of the expansion, as well as the realization of learning com basis.

关于猎人过河问题 要解决这个问题就要使过河时载两个过河，返回时尽量只有一个回来。用一个字符串数组来存猎人，狼，羊，白菜；下标依次为0，1，2，3；但他们都有河这边和那边两种状态；为方便则定义一个结构，只含一个int型变量n；当在河这边时n设为0；在河那边时n设为1。由于每次过河与返回都要考虑狼能否吃羊或羊能否吃白菜；则需要一个函数来判断每次选择是否满足条件。-Hunters across the river on the issues to resolve this issue so we should cross the river when the two set out across the river to return to when there is only one back as far as possible. Using a string array to keep hunters, the wolf, sheep, and cabbage subscript followed by 0,1,2,3 but they have a river here and there two states To facilitate the definition of a structure containing only an int variable n When in the river here when n is set to 0 in the river when n is set to one side. Due to cross the river and return each time to consider whether the wolf can eat the sheep吃羊or cabbage you need a function to determine each choose whether or not to meet the conditions.

Esta es suma de 矩阵 en windows 窗体。 由卡洛斯 · 恩里克 · Paucar 法尔凡

实现1000的阶乘，并且可以从结果中算出包含2的个数-a math problem

一种新的穿透防火墙的数据传输技术,过程如下: 1. 找出目标进程 2. 找出SOCKET句柄 2. 用DuplicateHandle()函数将其SOCKET转换为能被自己使用. 3. 用转换后的SOCKET进行数据传输-a new firewall penetration data transmission technology, the process is as follows : 1. The process of identifying two goals. Identify SOCKET handle two. With DuplicateHandle () function to be converted to SOCKET their own use. 3. After the conversion used for data transmission SOCKET