视频教程，不用多说了，一看就会了 开发环境搭建XP+VMware+Redhat9.0安装教程...

此文件是拼图游戏(由鼠标控制点击,可选折不同的拼图内容)-puzzles (by clicking on the mouse control, optional packs of different puzzles.)

93-96usaco的试题与解答，对参加io和acm的同学非常有帮助。-93-96usaco the questions and answers for students to participate in io and acm very helpful.

enabler－按钮激活工具-enabler- button activation tool

Memory Game, for testing your memory!

北大青鸟ACCP课程S2项目案例2影院售票系统-Beida Jade Bird project ACCP courses S2 cinema ticketing system Case 2

mmstatd包含一个 C库和服务器，用于让应用程序很容易的更新计数器和管理器，以便对它们进行维护。它用内部日志支持事故恢复系统。-mmstatd contains a C storehouse and the server, uses in to let the application procedure very easy renewal counter and the management, in order to carries on the maintenance to them. It uses the internal diary support accident to restore the system.

Symbian OS S60平台2D游戏引擎案例

an approach for capturing similarity between words that was concerned with the syntactic similarity of two strings. Today we are back to discuss another approach that is more concerned with the meaning of words. Semantic similarity is a confidence score that reflects the semantic relation between the meanings of two sentences. It is difficult to gain a high accuracy score because the exact semantic meanings are completely understood only in a particular context.

狗自己找宝藏去地图，有宝藏，根据狗的某种走法，如果能在宝藏里找到，输出的是走几步，如果不工作那输出是不可能的

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then