本人的练习2的答案， 供大家参考， 希望大家喜欢

void hugemenu()//最大的菜单 {     char menu;  //服务项目菜单  采用字符型比较可靠！因为如果定义成整型，万一输入了字符，可能会造成死循环错误     while(1) //系统将一直运行 直到运行 turnoff()函数     {         printf(" ********************欢迎您使用本系统******************** ");         printf(" 【请选择服务项目】: ");         printf(" 1.客户取票 2.VIP服务 3.客服系统 4.关闭系统 ");         printf(" 【您的选择】：");         scanf("%s",&menu); //用%s 比%c好 %c会记录字符 而且比如

张涛工作室ASP图书管理系统V3.0，还不错挺实用的-Zhang Tao, library management system ASP Studio V3.0, very good practical

用VB6.0进行solidworks的二次开发，包括数据库操作，零件的参数化生成等应用。-SolidWorks using VB6.0 for secondary development, including database operations, parts of the parametric generation of applications.

数据结构上机实验内容 索引顺序表的查找源程序代码-data structure on the plane experiment content indexing table lookup sequence source code

VB图书管理系统，基于VB的图书管理系统的程序开发，只作参考-VB library management system, library management system based on the VB-program development, only for reference

实现Haffman算法,有输入的接口,需输入字符及其权重,能自动生成Haffman编码-achieve Haffman algorithm, the input interface, the need to import characters and weights, can automatically generate code Haffman

自创的彼此交流账目软件，难得的好软件请一定要下来看看。-self-exchange accounts software, a rare good software must please look down.

Mysql for Windows最新源码，vc6vs.net均可编译，吐血上传。-Mysql latest source code for Windows, vc6 vs.net can compile and upload to vomit blood.

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

一元多项式的计算,建立两个多项式，并进行相加，相减运算，输出结果.参考资料：严蔚敏《数据结构与算法》-one yuan polynomial calculations, the establishment of two polynomials, and together, subtract operation, the output results. References : Yan Wei Min "data structure and algorithm"