this is a separate rule and the application of recursive the perfect embodiment...

数据结构作业－停车场管理-operating data structure-the car park management

一个用c++语言写的、学习简单工厂模式的代码。通过一个父类（OperationFactroy）指针，实现通过判断输入的计算符号而调用加、减、乘、除子类操作的简单代码。

1、读入城市结点数据 */ /* 2、邻接矩阵初始化：所有元素赋Infinity， */ /* 对角线元素赋0 */ /* 3、读入城市间边的数据，转换为邻接矩阵的数据 */ /* 4、路径矩阵初始化，若arc[i][j]

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

数据算法，凉东问题-data algorithm, the cooler East problem

一个短小精悍的PARADOX数据文件DB的修复工具，能修复绝大多数损坏的DB文件。-a small and PARADOX DB data file repair tool to repair damage to the majority of DB documents.

&公共静态字节[]加密（SqlString s）

界面美观,模块功能清晰,连接数据库,适合初学者-Beautiful interface, the module features a clear, connected databases, suitable for beginners

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

无限位的大数加减运算，纠错能力很强，界面间接-unlimited majority of the modified bit computing, a strong correction capabilities, interface indirectly