access数据库转换成excel表格，或由excel表格转入access数据库

数据字典的说明,对数据库设计有极大的帮助-Data dictionary description of the database design a great help to

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

这是一个关于双色球走势的例子,希望对大家有点帮助.-This is an example of the trend on the Loans, in the hope that everyone to some extent.

1．定义顺序栈的数据结构 2．编写函数实现的栈的初始化、入栈、出栈、判断栈是否为空的算法，并应用与表达式的括号匹配检测。 3．定义队列的链式数据结构 4．编写函数实现链队列的入队列、出队列算法-1. Stack data structure defines the order of 2. Write a function to achieve the initialization of the stack, stack, out of the stack, to determine whether the stack is empty the algorithm, and application and matches the test expression in parentheses. 3. Chain data structure defines queue 4. Write a function to achieve chain of queues into queue, a queue algorithm

多种排序方法的c实现和查找。入门看看还可以-various methods of sorting and searching c achieve. Portal can also see

数据结构实验，表达式求值的源码以及实验报告。-Experimental data structure, the source expression is evaluated and experimental report.

该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.

对给定的N个数进行排序，进行非降次序排序，要求使用归并排序-The number of a given set of n sorted, according to the non-descending order of arrangement, requires the use of merge sort

最段路径算法C++实现 实现工程清晰可见 仅供参考-Most paragraphs path algorithm C++ Realize realize the project clearly visible for reference only

目前元数据管理主要使用的石竹的元数据管理工具，但价格高昂，本人的元数据管理工具，基于元数据规范实现了元数据的采集、交换、溯源等功能，基本满足了日常数据仓库管理的需要