旅行商问题的动态规划方法已加入票据。

用纯C语言写的一个通讯录程序，通过链表存储，自己设计界面。-Using pure C language to write an address book program, through the chain store, the interface of their own design.

经典问题汉诺塔的递归解法（C++版），欢迎大家下载！-classic problem HANOR recursive solution (C version), all are welcome to download!

实现文本内容的自动校验，标签属性与普通input相似，使用该标签后无需再考虑数据提交时的据校验问题。与struts的动态表单需要大量配置校验文本规则相比，这里的工作量为0。 -achieve text automatic calibration, labeling and regular input attributes similar after using the label no longer consider the data submitted was checking the problem. Struts and the need to form large dynamic configuration rules than checking the text, the workload here is 0.

从专业设备上读取数据图像，并对其进行分析的代码。-from professional equipment to read data from images and analysis of its code.

1.具有低温上电和高温断电功能； 2.能够进行温度上限和温度下限设置，并且实时显示温度； 程序内以给出详细注释.-1. With a low temperature and high temperature power-off function 2. To carry out the minimum temperature and maximum temperature settings, and real-time display of temperature process to give detailed comments.

VISUAL C plus CSTRING 的详细使用代码-This is c++ descriptions how to use c++ string

VC7写的，用来将金山单词本生成的文本文件转换成为我想要的其它格式写的。有兴趣的可以看看。-VC7 wrote, Jinshan words used to generate the text of the document I want to switch to the other format writes. Interested can look at.

因为 Windows 下执行 awk print ... 效率实在太低，所以引入 awkprint，相当于 awkprint awkprint by Cao Siqin, 2007.7.17 awkprint Format string: It may contain following symbols: $x: parameter x will be used here = x07 = x0A Example: script.txt: C:WINDOWSa logfile .log C:WINDOWS txtfile .txt input this command in a console window: awk notepad.exe $1 $3 < script.txt then following commands will be listed: C:WINDOWSa.log C:WINDOWS.txt-Because the Windows implementation of awk print ... efficiency is too low, so the introduction of awkprint, equivalent to awkprintawkprint by Cao Siqin, 2007.7.17awkprint

这是一个名为“学生信息管理系统”的程序，您可以对学生信息做一些简单的操作！

关于猎人过河问题 要解决这个问题就要使过河时载两个过河，返回时尽量只有一个回来。用一个字符串数组来存猎人，狼，羊，白菜；下标依次为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.