利用VB制作的一款小游戏，是我的课程设计。

系统可用编辑器1. Overview 2. System Requirements 3. Contents of the Distribution Package 4. List of Available Command Line Flag Options 5. Contents of the Extracted Files 6. Installing the Software in Interactive Mode 7. Installing the Software in Silent Mode 8. Installing the INF Files Prior to OS Installation 8A. Installing the Windows* XP INF Files Prior to OS Installation-system can be an editor. Overview 2. System Requirements 3. Contents of the Distribution Package 4. List of Flag Available Command Line Options 5. Contents of the Extracted Files 6. Installing the Interactive Software in Mode 7. Installing the Software in Silent Mode 8. Installing the INF Files Prior to OS Installation 8A.* Installing the Windows XP Files INF Prior to OS Installation

在c#中调用rpt，实现c#的打印 打印格式必须固定 打印时调用这个打印格式-in c# Calling rpt achieve c# Print Print Print format must be fixed when the call Print format

热血精灵――纯绿色游戏辅助工具，暂不提供源代码-Blood wizard- Pure Green game aids, not to provide source code

制作网页特效的东东，对各位个人主页的站长一定有用的-production netnew saucepan, individual right to the head of Home certain useful

校园管理系统。电子商务类的，功能强大，制作合理。-campus management system. E-commerce category, powerful, production reasonable.

数据库结构课本中二叉树中求最小代价生成树-Textbooks in the binary tree database structure in order to minimize the cost of spanning tree

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

本压缩文件是关于windows xp优化大师的七十项REG文件-the compressed files on the windows xp optimize the master document 70 REG

cc1020 smartRf TI Chipcon -cc1020 smartRf TI Chipcon

Windows Mobile 开发资源,介绍了一些开发资源，很好。-Windows Mobile development resources, introduce a number of development resources, very good.