骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n* n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vertical, horizontal or a vertical two-step further vaulting horse rules traveled a checkerboard lattice of each and every one lattice just take time.

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

这个项目用来跟踪政策的 LIC 数据库。通过使用此您可以搜索策略、 添加政策、 添加客户、 添加代理、 搜索 AGGENT，查看代理配置文件和更多。所以它是很好用的数据库。

unix上的ODBC实现-unix on ODBC to achieve

迷宫算法,找出较优的路径,找到出口.算法效率比较高-maze algorithm to find the optimum path, finding an exit. More efficient algorithm

merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen ts in S whose sum is exactly x.

一个自己定义的数组外包装，这是“使用者自定义stl容器“的一个好例子，在数组之外包装了一层常用的容器界面。-own definition of an array overpack, which is a "user-defined stl containers" of a good example In addition to the array of packaging containers used layer interface.

这是求职者可找在线招聘管理系统。每位求职者将登录到事故帐户和更新他他可以创建他的简历的信息。他会申请这份工作。可以搜索多个工作。管理员将看到求职者已经申请了这份工作的所有列表。他可以看到他们的个人资料，可以招募他们。为招募他要召唤他们的采访。他将给招聘者发送电子邮件。自动化的电子邮件将被创建并发送给求职者。电子邮件中包含的时间面试和作业的详细信息。

应用背景源系统，用penunjang科德metode看到使用Visual Basic 6关键技术源科德ini使用马来语pemroragam Visual Basic 6丹，databasenya，MySQL，mengkoneksikannya dibutuhkan XAMPP ODBC连接器

图的DFS遍历，以及两种拓扑排序的实现，一种是DFS拓扑排序，另一种是无后继结点的拓扑排序-map DFS traversal, and the two topological sorting the realization DFS is a topological sorting, Another is no subsequent node of topological sorting