54678976543

该程序能够实现计算器程序设计，采用C++编程，来自C++程序设计原理与实践。(The program can achieve calculator program design, using C++ programming, program design from C++ Principles and Practice)

用C语言编写的堆栈接口，适用于各种环境，提供接口： STACK *initStack(int MaxRoom) void destroyStack(STACK **spp) void resetStack(STACK *sp) Boolean isStackEmpty(STACK stack) Boolean isStackFull(STACK stack) Boolean push(STACK *sp, USER_TYPE data) Boolean pop(STACK *sp, USER_TYPE *data) Boolean readTop(STACK stack, USER_TYPE *data) (C language implementation of the stack)

校运动会代码（部分），使用VB编程，由学生自己开发(yundonghui)

Visual C下提取点阵字模源代码，可可直接生成C语言的code，可选字体，大小. (The dot matrix source code Visual C extract, cocoa directly generate C language code, selectable font, size.)

说明：  实验题目：5.1 基于顺序栈的括号匹配程序设计验证 一、实验目的 1. 掌握栈的顺序存储结构； 2. 掌握栈的操作特性； 3. 掌握基于顺序栈的基本操作的实现方法。 二、实验内容 1. 实现顺序栈的成员函数； 2. 基于顺序栈的括号匹配程序设计验证。 实验题目：5.2 基于链式栈的表达式的计算程序设计验证 一、实验目的 1. 掌握栈的链式存储结构； 2. 掌握栈的操作特性； 3. 掌握基于链式栈的基本操作的实现方法。 二、实验内容 1. 实现链式栈的成员函数； 2. 基于链式栈的表达式的计算程序设计。 (Experiment Title: 5.1 Based on the order of the stack in parentheses matching program design verification 1, experimental purposes 1. To master the order of the stack storage structure 2. Master stack operating characteristic 3. To master the basic operation of stack based on the order of the realization method. Second, experimental content 1. To achieve the order of the stack member function 2. Based on the order of the stack in parentheses matching program design verification. Experiment Title: 5.2 Based on the expression stack chain calculation program design verification 1, experimental purposes 1. Master stack chain storage structure 2. Master stack operating characteristic 3. To master the basic operation of stack-based chain implementations. Second, experimental content 1. To achieve chain stack member function 2. Based on the calculation of the expression stack chain programming)

用VC操作EXCEL的方法，生成了一个excel表格(EXCEL using VC operation method to generate a excel form)

说明：  构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。(Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.)

说明：  Description Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. ()

个详细的ping程序阅读报告,包括流程图和详细的代码注释()

可将输入的任意十进制数转换为你想要任意进制数。(Any input can be converted to decimal you want any decimal.)