开发了一款自动取款机软件，用于执行所有银行交易，如现金存款、取款、娱乐...
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次)
北京大学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
通达信文件读取分时数据结构。 研究通达信数据结构的基础。
Reading Mastery letter file-sharing data structures. Of accessible information based on the data structure. (2013-07-01, C++, 1KB, 下载99次)
企业发放的奖金根据利润提成。利润(I)低于或等于10万元时，奖金可提10 ；利润高 于10万元，低于20万元时，低于10万元的部分按10 提成，高于10万元的部分，可可提 成7.5 ；20万到40万之间时，高于20万元的部分，可提成5 ；40万到60万之间时高于 40万元的部分，可提成3 ；60万到100万之间时，高于60万元的部分，可提成1.5 ，高于 100万元时，超过100万元的部分按1 提成，从键盘输入当月利润I，求应发放奖金总数 掉不满足条件的排列。
Corporate bonuses based on the profit commission. Profit (I) less than or equal to 10 million, money can be raised 10 profit of more than 10 million, less than 20 million, less than 10 million part of the commission of 10 , higher than 100,000 yuan part, cocoa 7.5 commission 200000-400000 between, more than 20 million parts can commission of 5 400000-600000 among more than 40 million part time, can be 3 commission 600000-1000000 between, more than 60 million parts can commission of 1.5 , higher than 100 million, more than 100 million Part of the 1 commission, monthly profits from the keyboard input I, seeking to be the total number of bonuses out of the arrangement does not meet the conditions. (2011-09-03, C++, 3KB, 下载5次)
一道经典的动态规划题目
浙江大学硕士生入学复试上机题
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次)