没什么特别的 用ASSECC数据库~――~

该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.

DELPHI+ACCESS 客户关系管理-DELPHI+ ACCESS Customer Relationship Management

这是一个连接数据库的类，非常有用，感谢指教-This is a type of database connections, very useful

1．定义串的顺序存储结构。 2．编写函数实现串的初始化、分配、取子串算法 3．编写函数据实现串的模式匹配-1. The definition of the order of string storage structure. 2. The initialization string write function implementation, distribution, taking sub-string algorithm 3. Write a function, according to string pattern matching to achieve

任意的表达式求解！ 包括函数。-arbitrary formula to solve! Including function.

多中通用排序算法组合源码，不好用你找我.-Sorting algorithm and more general source portfolio, not me with you.

图的建立、遍历、最小生成树、最短路径 图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path

旅行商问题， 旅行商问题，旅行商问题。-Traveling salesman problem, traveling salesman problem, traveling salesman problem.

用JAVA开发的数据库底层核心，是学习用JAVA开发数据库系统的必要资料。-with JAVA development of the database underlying core, Java is used to study the development of a database system the necessary information.

假设某银行有4个窗口对外接待客户，从早晨银行开门起不断有客户进入银行，由于每个窗口在某个时刻只能接待一个客户。因此在客户人数众多时需要在每个窗口前顺次排队，对于刚进入银行的客户。如果某个窗口的业务员正空闲，则可上前输业务。反之，若个窗口均有客户所占，他便会排在为数最少的队伍后面。编制一个程序模拟银行的这种业务活动并计算一天中客户在银行的平均逗留时间。