写了一个小型的推箱子游戏,只有一关，但可推广

不成熟不要紧--一个高级白领的职场亲历 读懂了别人的经验，也就缩短了你积累的过程，使你迸发的更快、更精彩！-Immaturity does not matter- a high-level white-collar job market witnessed understands the experience of others, you also reduce the accumulation process, and make you burst out of the faster, more exciting!

采用VB6编制的小小程序，有源代码，无须解压密码，能够将阿拉伯数字转换成汉字-use VB6 procedures for the preparation of small, active code without extracting passwords can be converted into Arabic Chinese

说明:程序代码主要参考网上一个类似功能的Demo.出发点在于学习div+css布局技巧,学习窗口对象拖动的实现原理. 3.功能说明: ^.^! 基本类似于javaeye登入窗口的功能,支持窗口的拖动,窗口的关闭 登入表单的最小化,最大化 在IE浏览器中有滤镜功能 没有对div做圆角处理,看起有点楞楞的. 4.偶在IE6.0和Mozilla Firefox2.0.0.1_cn浏览器中跑过,可以正常使用.-Description: The program code similar to the main reference line features a Demo. The starting point is to learn div+ css layout techniques, learning the realization of principles of dragging the window object. 3. Function Description: ^. ^! Basically similar to the javaeye login window function, support a window dragging, the window closed login form to minimize, maximize in IE browser, there are filter functions div do not deal with rounded corners, looks a bit Leng Leng" s. 4. Even in the IE6.0 and Mozilla Firefox2.0.0.1_cn ran browsers can be used normally.

这是一个用汇编编写的文本编辑器 虽然还不太完美 但应付作业是没问题的-This a compilation prepared by the use of text editors, while not perfectly but is not cope with the operational issues

Visual C++游戏开发经典案例详解 俄罗斯方块（Tetris, 俄文：Тетрис）是一款风靡全球的电视游戏机和掌上游戏机 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

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

实用的java习题,初学者可用-Java practical exercises, beginners can be used

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

python初学者教材，使读者能更深刻了解python的精髓，讲的很透彻-python beginner teaching materials, allowing the reader to a deeper understanding of the essence of python, speaking very thorough

OVM(Open Verification Methdology) for system verilog or systemC