税率倒算，把原来计算好数额倒算回来。帐号有两种，一种是只查看的，一种是只计算的。...

一个使用射频卡的考勤软件-use of a radio-frequency card appraisal software

这是我本人编写的一个32位定点小数运算的函数库。对于没有浮点运算器的场合，可以提供进行小数运算的一种途径-This is my prepared in a 32-bit fixed point decimal computing functions. For no floating point unit occasions, it can provide for fractional arithmetic, as a way to

C++ Builder程序员学习数据结构第8章-Builder programmers learn C data structures Chapter 8

红黑树数据结构的c实现-RED-BLACK TREE data structure to achieve the c

编写一个算法，利用栈和队列的基本运算将指定队列中的内容进行逆转。 含完整程序

一个操作ＤＢＦ格式文件的类-an operation of the DBF format category

一个小型的数据库图书管理系统，较全的功能模块-A small library management system database, representing a full-function modules

别人的VC操作Access数据库都是用的GUI,让VC手生的看了迷糊,不得要领,这次我封装一个纯C++操作Access2000库的源代,主要封装了一个访问Access数据库的类,非常简单.-Someone else" s VC action Access databases are used in GUI, so that VC looked rusty" s confused, but to no avail, this time I packaged a pure C++ source operating Access2000 database generation, mainly encapsulates an Access database, access to classes, is very simple .

系统说明:这是一个应用数据库系统VFP开发的酒店管理系统.-system Note : This application is a database system developed by VFP hotel management system.

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.