数据结构一元多项式的实现

数据结构的源程序约瑟夫环和最短路径-data structure of the source Josephus and the shortest path

VB函数库大全，包含VB编程中所需的函数，比较全-Encyclopedia of VB function library that contains VB programming functions required to compare the whole

1、为病人提供更好更快、更快的服务，提高医院在医疗市场的竞争力以及吸引更多的病人到本医院就医； 2、人力工资昂贵，迫使医院采用计算机以提高劳动效率； 功能：1、门诊挂号：为病人提供就医卡方便病人； 2、住院病人管理系统：是医院可以随时了解病人情况； 3、药房管理系统：提高了药品管理的质量，和工作效率； 4、门诊医生工作站、住院费用的管理、病历管理系统、以及外部接口等。-1, for providing patients with better and faster and more efficient services and improve the hospital in the medical market competitiveness and to attract more patients to the hospital 2, manpower, high cost of labor, forcing hospitals to improve the working efficiency of the computer function : 1, out-patient registration: In order to provide patients with the convenience of patients for medical treatment card 2, patients management system: a hospital patient can understand 3, pharmacy management system: To improve the quality of drug management, and efficiency 4, the doctor-patient workstations, the cost of hospital management, medical records management system, as well as external interfaces.

三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)

代码名称：The alxBase classes for work with dbf files 代码说明：读写DBF文件的类 工具/平台：VC Win2-code name:The alxBase classes for work with dbf files. code specification: a class for reading DBF files.

推箱子状态空间搜索,慢慢研究吧。分支限界法，采用优先队列实现-tuixiangzi

算法函数实例，算法1，存放了书中所有的算法函数程序以及例子中的主函数程序-arithmetic functions example, an algorithm, the book store all the arithmetic functions procedures and examples of procedures for the main function

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20

计算大数阶乘，可以在1秒内计算出10000以上的整数阶乘-calculated factorial majority, in a calculated within seconds above 10,000 integer factorial

链表排序- The chain table arranges