网站首页

登录

luowenfeng

于 2020-12-29 发布文件大小:15KB

 0  240

下载积分: 1 下载次数: 6

我要下载

代码说明：

建立试题库文件，随机产生n个题目；题目涉及加减乘除，带括弧的混合运算；利用栈求解表达式的值；随时可以退出；保留历史分数，能回顾历史，给出与历史分数比较后的评价( The establishment of test database file, the subject of n randomly generated topics related to addition, subtraction, mixed operations with parentheses use the value of the expression stack solution ready to quit to preserve the historical scores, can look back at history, and history gives the comparison of scores Evaluation 保留历史分数，能回顾历史，给出与历史分数比较后的评价)

文件列表：

罗文凤（利用栈求表达式的值）
............................\利用栈求解表达式的值任务书.doc,76800,2009-06-15
............................\源代码
............................\......\markrec.txt,7,2009-06-23
............................\......\n_rec.txt,2,2009-06-23
............................\......\shitiku.txt,480,2009-06-22
............................\......\Stack.c,12926,2009-06-25

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

2013-10-29 16:31:47下载

积分：1
american_heritage
USACO中的American heritage，用C++编写，运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)

2013-07-21 18:31:10下载

积分：1
BigNumeberOperator
这是高精度大数运算的源码,对于大于64位的整形数字的四则运算，是万能的啊……(This is the code of big number s operator.)

2011-08-09 15:25:09下载

积分：1
huffman_src22
本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)

2007-06-15 16:02:25下载

积分：1
sort-algorithm-validation
直接插入排序算法验证。快速排序算法验证。直接选择排序算法验证。 (Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)

2013-04-22 19:18:54下载

积分：1
moni
数据结构银行模拟问题 (Bank of simulation data structure problem)

2011-01-04 21:08:10下载

积分：1
ggg
mfc 连接数据库用mfc做的管理系统，戏中包括数据库连接(mfc connect to the database)

2012-08-22 17:08:04下载

积分：1
backtrackng
给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品，使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)

2017-01-01 17:51:23下载

积分：1
test12
约瑟夫问题，用数据结构的循环链表实现约瑟夫问题的解答(Joseph problems，30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain )

2012-05-14 10:29:52下载

积分：1
DP
说明：动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

2012-11-12 08:52:31下载

积分：1

696516资源总数
106436会员总数
7今日下载