这本是sql编程必不可少的书籍,一般问题都能解决

这是PB数据库方面的一点心得体会，有实例和教程-This database is a bit of experience, there are examples and tutorials

游戏规则 目的：在本游戏中，你将作为一名裁缝，将尽可能多的纽扣穿成 一个闭合的路线。游戏初始有 15 个纽扣，随着时间的增 加，纽扣数目也增加，当达到70个时游戏即结束。 规则：只能在有纽扣的点穿线，且只能在水平方向或竖直方向穿 线。线可交叉，但有纽扣的点不能交叉连接。 秘诀：要尽可能使连线长且该连线上的纽扣数多。-purpose of the rules of the game : In the game, you will act as a tailor, as much as a button to wear closed routes. Initial games are 15 buttons, with the increase in time, increase the number of buttons, reached 70 at the end of that game. Rules : only when there is the point of threading button, and then only in the horizontal direction or vertical direction of threading. Cross-line, but the point Button can cross-connect. The secret : To the extent possible, but the long-line connections on the button a few more.

some avr jtag schematics

Hex evaluation and calculator with logical and arithmetic operators-Hex evaluation and calculator with logica l and arithmetic operators

C# 是创新性的新式编程语言，它巧妙地结合了最常用的行业语言和研究语言中的功能。在保持 C# 设计思想不变的同时，Microsoft 在 C# 语言中引入了几种潜在的新功能，提高了开发人员在语言构造方面的效率-C# is the innovative new programming language, It cleverly combines the industry"s most commonly used language and study language functions. C# in maintaining the same design at the same time, Microsoft C# language in the introduction of several new functional potential, improve the development of language structure in terms of efficiency

股票成本计算器,很有用的.如果需要源程序,请发邮件!-stock cost calculators, very useful. If you need source code, please send mail!

个个人自娱乐的扑克牌游戏 ，希望大家能够得到一定的帮助-individuals from the entertainment poker games, we hope to get some help! !

自己的扫雷程序源代码,结构灵巧-This is my source of the mine ,with flexible structor

贪吃蛇代码实现，适用于初学者。贪吃蛇代码实现，适用于初学者。贪吃蛇代码实现，适用于初学者。

[输入] 图的顶点个数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