VB航空公司管理系统，数据库使用SQL2

环形链表结点出排-circular linked list node wait-

程序存储问题:设有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

算法，钱币组合。可设定钱币种类数量，找出组合种数。-Algorithm, coin combinations. Can set the number of coin types, identify the combination of species.

本程序是实现二叉树跟树的常用算法，都是尽量用非递归来编写的。关于二叉树的都可以从键盘动态输入，关于树的就不可以，原因是树的结构问题，在程序中，树的建立用到动态左孩子/右孩子建立-this program is a binary tree with the tree is commonly used algorithm, as possible, to use non- recursive prepared. On the binary tree can be dynamic input from the keyboard, on the tree will not be able to because of the tree structure, in the process, the tree is used to establish dynamic children left/right to establish child

这里有一些数据结构中的通用算法，拿出来和大家共享了◎-Here are some of the generic data structure algorithms, up to and everyone shared ◎

一个小型的嵌入式数据库，支持SQL命令，使用非常简单-a small embedded database support SQL commands, the use of very simple

完全基于ODBC API封装的数据库访问库源代码。可以支持主流数据库。接口间接，清晰。-Based entirely on the ODBC API package, database access library source code. Can support the mainstream databases. Interface, indirect and clear.

该源代码利用计算机模拟乘法竖式 计算阶乘 将每位数子保存在用new分配的一长字符数组里 在本人的机子上可计算30000!的精确值 用时近60秒-the source code used a computer simulation multiplication calculation factorial shaft will be preserved for each digit used in the distribution of a new long arrays of characters in my machine on computable 30,000! The precise value of time spent nearly 60 seconds

这是一个TSP问题的限界算法，用C++编程的

非常非常好的消息来源。访问学习数据库。有详细的解释。我们希望能帮上忙