一个手机RPG游戏的源代码，包含资源图片，eclipse工程文件。

西安电磁科技大学上级作业部分程序.-Electromagnetic Xi

用户通过这个程序可以方便的进行星期的查询。-users can facilitate this process for the week of inquiries.

Java编的连连看游戏，希望会喜欢-Java series Lianliankan game, hope it will be like

1. 发卡服务端：Server 项目文件：autojet.prj 2. 计费客户端：Client 项目文件：internet.prj Explorer.prj 先启动Explorer.exe, 再启动internet.exe 3. 数据库脚本 INIT（原版）.SQL 和 New init.sql（新版），数据库名 NetBar 4. 动态连接库： NETBAR.dll hookdll.dll 5. 大学生公寓城System ID为5046 其余程序说明全在程序内的文本文件中说明-1. round card service end: Server project document: Autojet.prj 2. costs the customer end: Client project document: Internet.prj Explorer.prj First starts Explorer.exe, then starts internet.exe 3. databases scripts INIT (first edition) SQL and New init.sql (new edition), database NetBar 4. dynamic connections storehouses: NETBAR.dll hookdll.dll 5. university students lodgings city System ID is 5,046 other procedures explained all explained in the procedure text documents

经典游戏炸弹人的手机版本,又J2ME平台开发.可下载到手机中.-bomb classic game of mobile phones, J2ME platform. To download to your phone.

C语言语法，详细讲解了volatile_unsigned_ long的使用-C language syntax, explained in detail the use of volatile_unsigned_ long

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

一个简单的大赛评分系统，可以输入评委人数，然后根据每个选手的得分进行排名。-Contest a simple scoring system, can enter the number of judges, and then the score of each player ranked.

墙纸每日换的小东西，虽然代码简单，但确实是精华，优化了好几次的-Wallpaper every day for little things, though the code simple, but it does here are optimized for several times

经常使用Protel99se的同学们一定都觉得它的鼠标功能不尽不意吧，这里给大家提供一个对Protel99se鼠标功能的增强工具。可以支持用鼠标对图象进行放大，移动，旋转等功能。在此向作者表示感谢-often use to the students who will feel the mouse function not unwittingly bar, Here we provide to the one pair of Protel99se function in the mouse tool. Can support the use of the mouse on the image to enlarge it, moving, rotating, and other functions. Like to thank the authors said. !