This a source code of telephone number search system,it is very useful

迷宫的问题实质上就是图的遍历问题，我们可以用一个二维数组存储一个迷宫的各个结点，给定一个开始的坐标和一个结束的坐标．本程序可以寻找一条路径，但这条路径不是最短的．就是说不是最优的．-maze is the essence of the plan traverse the problem, we can use a two-dimensional array storage a maze of the various nodes, to set a beginning and an end coordinates of the coordinates. This procedure can find a path, but this is not the shortest path. Not to say the best.

一、问题描述：将多个多项式输入并存储在内存中，然后对多项式进行加，减，乘等基本运算。 二、实行数据方法：用单链表来储存多项式，每个节点存储一项-First, the problem Description: The number of polynomial input and stored in memory, and then make additions to the polynomial, subtraction, multiplication and other basic computing. Second, the implementation of data Methods: Single-Linked List to store polynomials, each node storing a

这本书就不用介绍了，相信很多人都对它久闻大名。这是第三版第一卷中文版。字体非常清晰，适合收藏。我搜了一下本站里也有，但从大小上判断应该不会有这个质量好。-This book would not have introduced, I believe many people have heard so much about it daimyo. This is the third edition of the first volume in Chinese. The font is very clear, suitable for collection. Site where I found a bit there, but the size of the judgments should not have this quality.

一个很好的SOKET通信程序，包括客户端和服务器端，编译时候带参数/c或者/s-a good socket communication program, including client and server sides. Compile with parameter /c or /s

魔术数字程序－－经典程序-magic number procedures-- procedures classic

运用Vc++创建ActiveX控件容器的应用实例程序-The use of Vc++ to create ActiveX control container application procedures

fifo源程序，VHDL编写~具有一定的参考价值~-source code of a fifo, writen in VHDL, will be useful to some extent as a reference

windows 98/2000/NT/XP

筛库 SET TALK OFF SELECT 街乡码,count(*) FROM aaa GROUP BY 街乡码 INTO ARRAY 街乡码库 FOR i=1 TO _TALLY SELECT * FROM aaa WHERE aaa.街乡码 = 街乡码库[i,1] INTO TABLE ( 街乡 +街乡码库[i,1]) ENDFOR CLOSE DATABASES-Sieve library SET TALK OFF SELECT街乡code, count (*) FROM aaa GROUP BY街乡code INTO ARRAY街乡Code Library FOR i = 1 TO _TALLY SELECT* FROM aaa WHERE aaa.街乡Code =街乡code library [i , 1] INTO TABLE (街乡+街乡code libraries [i, 1]) ENDFOR CLOSE DATABASES