开发了一款自动取款机软件，用于执行所有银行交易，如现金存款、取款、娱乐...
Developed a software for ATM machine which performs all the banking transactions like cash deposits, withdrawals, fund transfers and also maintains a transaction history of an account. The software was developed using OOPS concepts in C++ and Data Structures. (2016-01-29, C++, 0KB, 下载0次)
结构化数据网络
Structured data network (2018-11-30, C++, 0KB, 下载0次)
北京大学ACM练习网站1003题代码,具体请参考http acm pku edu cn JudgeOnline problem id 10 (2018-05-27, C++, 4KB, 下载0次)
http://www.pudn.com/Download/item/id/1527398835449720.html
数据结构的c++语言描述中文版，刘卫东和沈官林合译。
Describe data structures by c++ program. (2017-07-01, C++, 19687KB, 下载3次)
AOE网。实现AOE网查找关键路径。分别列出每个活动的最短时间和最长时间
failed to translate aaaaaaaa (2016-02-14, C++, 1KB, 下载1次)
网的邻接矩阵存储（数组表示）、简单输出，最小生成树，采用Prim算法实现最小生成树。
Network adjacency matrix storage (array representation), a simple output, minimum spanning tree, minimum spanning tree using Prim algorithm. (2010-08-16, C++, 1KB, 下载3次)
KRUSCAL算法实现演示程序，利用KRUSCAL算法求网的最小生成树，网中的节点和边由系统自动生成，图为带权图。
KRUSCAL algorithm demo program, using KRUSCAL minimum spanning tree algorithm to solve network, network nodes and edges generated automatically by the system, photo shows a weighted graph. (2010-05-02, C++, 2KB, 下载4次)
Prime 算法，创建有向图，无向图，有向网，无向网的算法
Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm (2009-09-24, C++, 1KB, 下载7次)
Floyd 算法，创建有向图，无向图，有向网，无向网的算法
Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm (2009-09-24, C++, 1KB, 下载11次)
创建有向图，无向图，有向网，无向网的算法
Create a directed graph, undirected graph, directed networks, undirected networks algorithm (2009-09-24, C++, 1KB, 下载14次)
一道经典的动态规划题目
浙江大学硕士生入学复试上机题
http://acm.hdu.edu.cn/showproblem.php?pid=1231
Classic dynamic programming
http://acm.hdu.edu.cn/showproblem.php?pid=1231 (2009-08-19, C++, 1KB, 下载2次)
spoj MSTS
kruskal +生成树
spoj MSTSkruskal+ Spanning Tree (2008-07-15, C++, 2KB, 下载19次)
一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8-3.1x11)+(7-5x8+11x9) (2) (6x-3-x+4.4x2-1.2x9)-(-6x-3+5.4x2+7.8x15) (3) (x+x2+x3)+0 (4) (x+x3)-(-x-x-3)
one yuan sparse polynomial calculator [Addition and multiplication] Problem description : Design one yuan polynomial coefficient counter achieve the two polynomials addition, subtraction. Basic requirements : (a) input and the establishment of polynomial (2) output polynomial, the output form of integer sequence : n, c1, e1, c2, e2 ... cn, en, where n is the polynomial Number, ci, ei for the first item i the coefficients and indexes. By sequencing index in descending order. (3) a and b polynomial addition, the establishment of a polynomial b, the combined output polynomial. (4) a and b polynomial subtraction, the establishment of a polynomial-b, the output phase by polynomials. With the first table with a single node Chain store polynomial. Test data : (1) (2x 5x8- 3.1x11) (7-5x8 swath) ( (2005-07-07, C++, 37KB, 下载85次)
该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。
the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities. (2005-04-24, C++, 1KB, 下载39次)