多项式的计算器，可以用来加减乘除各类多项式并得出正确结果...

练习时做的一个老乡通信录管理系统,可从WORD中导入数据,存入ACCESS数据库中-Practicing to do a hometown address book management system can be obtained from WORD to import the data into ACCESS database

一个基于VC+ACCESS的酒店业务管理系统，内附说明书-a VC-based ACCESS hotel operations management system, enclosing brochures

这是我自己写的从数据库中读出数据，并显示，并构成不规则三角网的程序，可以在程序中添加约束线。-This is written in my own读出数据from the database and displays, and triangulated irregular network constitutes the procedure, you can add a constraint in the procedure line.

10名海盗抢得了窖藏的100块金子，并打算瓜分 这些战利品。这是一些讲民主的海盗（当然是他们自己特有的民主），他们的习惯 是按下面的方式进行分配：最厉害的一名海盗提出分配方案，然后所有的海盗（包 括提出方案者本人）就此方案进行表决。如果50%或更多的海盗赞同此方案，此方 案就获得通过并据此分配战利品。否则提出方案的海盗将被扔到海里，然后下提名 最厉害的海盗又重复上述过程-10 pirates seize a cache of 100 gold, and plan to divide up these spoils of war. This is the democracy of some pirates (of course it was their own unique democracy), their habits are based on the following manner allocation : one of the most powerful pirate proposed distribution plan, and then all the pirates (including the proposal himself) on this program for a vote. If 50% or more of the pirates agreed to this program, this program was adopted and on the allocation of spoils of war. Otherwise, the proposals will be pirates thrown into the sea, and then nominate the most serious piracy repeated this process

快速傅立叶变换FFT的动态链接库DLL，适合个种语言，VB，VC，delphi-FFT fast Fourier transform of the DLL, suitable species language, VB, VC, Delphi, etc.

关于二叉排序树胡数据结构程序课程设计代码-On the binary sort tree data structure procedures Hu curriculum design code

它是在 c + + 中的 b + 树实现，是用来查找、 插入和一次晚点的节点，并且我们可以创建到使用的虚拟磁盘

二叉树的建立和遍历c++语言非递归和递归实现-The establishment and traverse binary tree c++ language implementation of non-recursive and recursive

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

经典矩阵运算问题求解-classic problem solving matrix operations