Informix SQL教程指南 V9.4，Informix中如何使用SQL

一个通讯录――――――利用C++实现的，非常不错哦-Address Book- C++ implementation

数据结构里的bfs算法，用vc6.0编写-data structure, the zheng algorithm used to prepare vc6.0

fastdb-241源码，俄国人开发实时数据库系统！-fastdb-241 source, the Russians to develop real-time database system!

根据储蓄管理条例，计算储蓄定期利息的程序。-savings under the regulations, the periodic interest savings calculation procedures.

从库中调用图片(10KB) 从库中调用图片(10KB)-Picture from the library call (10KB) picture from the library call (10KB)

ACM算法题集 基础算法教案.doc 算 法 设 计 题 集.doc 算法题集.doc-ACM algorithm based on algorithms title set lesson plans. Doc algorithm design problem sets. Doc title set algorithm. Doc

严蔚敏编写的《数据结构》第6章的答案，全部为源码-the answers of chapter 6 of a book called ‘Data Structures’ writen by Yan Wei Min

数据结构 基础要好-better data structure foundation

问题描述：设有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.

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree