Memory card Driver For HCL laptops

quake 1.32b版本(包含各种工具) 官方版本-quake version 1.32b (includes tools) official version

一个使用DirectX库开发的贪吃蛇程序。-A database developed by the use of DirectX Snake procedures.

这是一个简单的小游戏，电脑随机产生一个数字，玩家猜这个数是几，电脑会给出“大一点”或“小一点”的提示-This is a simple little game, a computer generated random numbers, players guess the number is few, the computer would give "little" or "small" tips

提供了RFID的开发源码，用VC编的，展示RFID卡如何加密，如何自毁。串口通讯支持RS-232(RS232)，RS-485(RS485)，波特率可选,RFID的天线可选，读卡频率可调。提供了控制RFID读卡功率的方法，功率从0至29可调，距离最大10米以上，该源码可用于交通、物流、运输、仓库管理、比条码技术强大。用于毕业论文答辩中，可以演示，程序看懂后，就对RFID整个工作原理较为了解。支持ISO18000和EPC_GEN2等类型的RFID卡。

CSS templates source codes. You can use this file souce codes to create your own menus.

For solving the following problem: "There is No Free Lunch" Time Limit: 1 Second Memory Limit: 32768 KB One day, CYJJ found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of "Lunch Special" which was said that one could "buy one get two for free". That is, if you buy one of the dishes on their menu, denoted by di with price pi , you may get the two neighboring dishes di-1 and di+1 for free! If you pick up d1, then you may get d2 and the last one dn for free, and if you choose the last one dn, you may get dn-1 and d1 for free. However, after investigation CYJJ realized that there was no free lunch at all. The price pi of the i-th dish was actually calculated by adding up twice the cost ci of the dish and half of the costs of the two "free" dishes. Now given all the prices on the menu, you are asked to help CYJJ find the cost of each of the dishes.

java 说明.下载到受机中不要在电脑中解压-java notes. downloaded to the affected machine will not unzip on your computer

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

这是一个有趣的节目，我的朋友，穆罕默德为我的课堂作业。我想和你们分享一下，因为它太棒了；

DM,ADM,DPCM,ADPCM.LP,PARCAR等语音压缩的算法,此为adpcm的c语言编写的程序-DM, ADM, DPCM, ADPCM.LP, PARCAR such as voice compression algorithm, for this mode of c written procedures