经典的俄罗斯方块游戏代码 ，c++ 实现。

自己做的东西，穿上来和大家分享一！！！ 如果谁要是能用到就下来-zi ji zuo de

使窗口的图标动起来 窗口的图标有"动"的效果，在任务的按钮中同样有"动"的效果。这样就为程序平添了一些生趣，从而更加引起用户的注意力。 -Moving up to the window" s icon window icons of " action" effect, in the same buttons in the task of " action" effect. Thus adding to a number of apathy for the program, thereby causing the user" s attention more.

将短消息放入到收件箱-Add to the Short Message Inbox

大学人事管理系统 大学人事管理系统-University of the University System of Personnel Management Personnel Management System University Personnel Management System

一个注册表监控程序regshort16的源代码。-a registry monitoring program regshort16 source.

一个很好用的挂机锁屏幕工具，能有效保护-The hang up with a good lock-screen tools, can effectively protect

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

一个VC++的课程设计，主要内容是运动在动态圆上的五角星。-a curriculum design, and main contents of the circular movement of the dynamic on the five-pointed star.

得到CPU的类型(C++源程序)-be CPU type (C source)