this program is very good

用vb语言，在access数据库中完成的代码，是最简单的平台下的数据库。有完善的功能系统，添加，删除，修改等等。access数据库的密码在代码演示框中左下角有，或者使用access密码暴力破。解器可以解决，其他都不是问题，是初学者学习的很好的资料。背景的图片可以替换，换成自己喜欢的背景，建议用学校本身的徽章等

这是用数据库语言编写的仓库管理系统-This is the database used to prepare the language Warehouse Management System

sysbase 12 用程序实现加卸载数据。

卷3为分拣和搜索，这是本书的第1个修订版，它是对计算机分拣和搜索的一流技术的最全面的研究，它扩展了卷1中数据结构的处理方法，将大小数据库以及内存和外部存储都包含在内。本书包括对计算机方法仔细检查的选择方案，和其效率的大量分析。本书该版的独特之处在于优化了的分拣，以及对通用散列法和排列法的新的理论论述。-Volume 3 for sorting and searching, this is the book of a revised edition, it is sorted on the computer and search the first-class technology of the most comprehensive study of its expansion Volume 1 data structure handling methods, the size of the database and external memory and storage are included. The book including computer methods carefully examined the options, and its efficiency lot of analysis. The book version of the unique features of the optimization is sorted, and right hash law and common law with the new theoretical expositions.

Magio牛的usaco源代码，希望和大家共同学习-Magio cattle usaco source code, hope and common learning

实现KMP算法。 经典的模式搜索算法。-KMP algorithm realization. Classical algorithms.

随机产生6个数字，并且数字产生不能相互重复，定义了一个时间变量，避免两次产生的数据相同

结构分析程序2，用fortran90编写，主要用于结构分析-two structural analysis procedures used to prepare FORTRAN90, mainly for structural analysis

皇后问题，第2解法! 皇后问题，第2解法!-Queen

以一个Maze(m, n)的长方阵表示迷宫, 迷宫的入口是Maze(1,1), 出口是Maze(m, n), Maze(i,j)等于0表示通路, Maze(i,j)等于1表示障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。各个命令以及相关数据的输入格式如下： 输入迷宫：C，接下来一行是m n，其中m是迷宫矩阵行数，n是迷宫矩阵列数，接下来的m行数据是迷宫矩阵，每行n个值，表示一个m*n的迷宫矩阵 求迷宫的一条通路：Q 当输入的命令为E时，程序结束-With a Maze (m, n), said the long square maze, the maze entrance is a Maze (1,1), exports is the Maze (m, n), Maze (i, j) is equal to 0, said channel, Maze (i, j) is equal to 1, said barrier. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no path. The various commands and data input format is as follows: Enter the Labyrinth: C, followed by his party mn, where m is the maze of matrix rows, n is a maze of matrix columns, the next line of data is a maze m matrix, each row n- value, indicating an m* n matrix of the labyrinth a maze of pathways: Q when the input command for the E, the end of the process