access into execl facilitate print statements, etc.

因为用mfc做了一个应用程序，需要在没有数据库的情况下，读取excel中的数据，需要注意的是要在文件名前面加上强制类型转换符L

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

Visual basic + sql server2000学员管理系统原代码-Visual basic+ sql server2000 student management system source

最大流问题的最短增广路径算法 是算法中的重要部分 -Maximum flow problem of the shortest augmenting path algorithm is an important part of the algorithm

以一个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

平衡二叉树实现一个动态查找表,有三种基本功能:查找,插入删除,还有选项功能:合并两棵平衡二叉树,和分裂两棵平衡二叉树.-balanced binary tree to achieve a dynamic lookup table, there are three basic functions : to find, delete, insert, functional options : merging two balanced binary tree, and split two balanced binary tree.

c语言小程序100个-100 small programs

Oracle培训18天老师的笔记，对学习oracle数据库有非常大的帮助-Oracle training in 18 days the teacher

COOL的PB框架界面-COOL framework of the PB interface

address management vb6