一个算术表达式是由操作数(operand)、运算符(operator)和界限符(delimiter)组成的。假设操作数是正整数，运算符只含加减乘除等四种运算符，界限符有左右括号和表达式起始、结束符“#”，如：#（7+15）*（23-28/4）#。引入表达式起始、结束符是为了方便。编程利用“算符优先法”求算术表达式的值。
[基本要求]
（1） 从键盘读入一个合法的算术表达式，输出正确的结果。
（2） 显示输入序列和栈的变化过程。
An arithmetic expression is an operand (operand), operator (operator) and boundary character (delimiter) thereof. Suppose is a positive integer operands, operators containing only addition, subtraction and other four operators, boundary character left and right parentheses and expressions start and end symbol # , such as:# (7+ 15)* (23-28/4)#. Introducing expressions start and end character is for convenience. Programming using the operator precedence Evaluate arithmetic expressions.
[basic requirements]
(1) Reading the keyboard into a legitimate arithmetic expressions, output the correct result.
(2) changes in the sequence and displays the input process stack. (2016-06-18, Visual C++, 2830KB, 下载2次)
编程实现希尔、快速、堆排序、归并排序算法。要求随机产生10000个数据存入磁盘文件，然后读入数据文件，分别采用不同的排序方法进行排序，并将结果存入文件中。
Programming Hill, fast, heap sort, merge sort algorithm. Requirements randomly generated 10,000 data into a disk file, and then read the data file, using different sorting methods to sort and store the result file. (2015-09-05, Visual C++, 13449KB, 下载24次)
编程模拟实现银行办理业务,当有多个空闲时刻相等的出纳窗口供客户选择时,由客户随机选择一个提供服务.使用了数据结构的知识，是学习的很好的例子
Programming simulation banking for business, when there are more idle time equal to the cashier window for customers to choose when, by the client randomly selects a service using knowledge of data structures, is a good example to learn (2015-05-11, Visual C++, 261KB, 下载3次)
这是数据结构的一个C++编程。在邻接矩阵上实现带权图、不带权图的初始化，搜索、插入、删除边，宽度遍历、深度遍历。邻接矩阵用模板类实现。
This is a programming data structure C++. Achieve a weighted graph in the adjacency matrix, with no right of map initialization, search, insert, delete edge, traversing the width and depth traversal. Adjacency matrix is implemented with a template class. (2013-12-15, Visual C++, 1KB, 下载3次)
该书是清华大学严蔚敏编写的《数据结构教材》，很经典的一部教材，介绍了数据结构的组成，有哪些数据结构，这些都讲贯穿在编程的过程中，所以应该学好数据结构。
The book is a data structure textbooks " written by Tsinghua University Yan Wei Min, The classic a textbook, the composition of the data structure, which data structure, these stresses throughout the learn data structures in the programming process, so it should be. (2013-03-25, Visual C++, 7410KB, 下载1次)
这是一个邮局选址问题。给定n 个居民点的位置,编程计算n 个居民点到邮局的距离总和的最小值。上传文件包括可执行文件、源代码和六组测试用例。
This is a post office location problem. N settlements given location, programming calculation of n settlements to the sum of the minimum distance from the post office. Upload files, including executable files, source code, and six groups of test cases. (2013-01-20, Visual C++, 140KB, 下载2次)
构造一棵二叉树、释放二叉链表中各结点的存储空间、获取指向二叉树根结点的指针、前序遍历二叉树、中序遍历二叉树、后序遍历二叉树等的编程
Construct a binary tree, the release of storage space for each node in the binary list, access points to the binary tree root pointer, before traversing Binary inorder binary tree traversal, postorder binary tree traversal programming (2012-11-30, Visual C++, 1KB, 下载3次)
CLOCK改进算法, 按照最多5块的内存分配情况，编程实现所选算法，动态输入访问内存的块号序列，输出置换结果；
测试：输入合法、非法的访问序列数据，检查程序的正确性和健壮性。
CLOCK algorithm improvements, in accordance with up to five memory allocation in programming to the selected algorithm, the dynamic input access memory block number sequence, the output displacement results test: Enter legal, illegal access to sequence data, check the correctness of the program and robust sex. (2012-05-25, Visual C++, 1KB, 下载3次)
实现教材中所描述的先来先服务算法，短进程优先调度算法和时间片轮转算法。通过对几组进程分别使用不同的调度 算法，计算进程的平均周转时间，比较算法的优劣。
实验内容：
编程实现本实验的程序，要求：
【a】编程实现进程的进程控制块，定义一个进程控制块的数据结构（PCB）应包括：
? 进程名称（ID）
? 进程需要执行时间
? 进入就绪队列时间
? 进程执行开始时间，进程执行结束时间
? 进程的优先级
Implementation described in the materials first-come first-served algorithm, priority scheduling algorithm and a short process time slice rotation algorithm. The process by several groups using different scheduling algorithms, respectively calculate the average turnaround time for the process to compare the merits of the algorithm. Experiment: The experimental procedure programming, requirements: 【a】 process of programming the process control block, defining a process control block data structure (PCB) should include: ? process name (ID) ? ? execution time required to enter the process ? ready queue time process execution start time, end time, the process of implementation of the priority of the process ? (2011-05-22, Visual C++, 2KB, 下载4次)
link_stack, 自己写的链栈，注释很清楚,运行通过，您可以由此温习下c语言编程。纯c写的，用的是vs2010编译器，您可以复制代码用别的编译器编也是可以的
link_stack, write their own chain stack, a comment is clear, run through, which you can study under the c programming language. Pure c write, using vs2010 compiler, you can copy the code compiled by other compilers is also possible (2011-05-11, Visual C++, 137KB, 下载2次)
C++算法大全，里面包含了单元加，底层编程，汉诺塔，逆阵，求进制，数据结构，数学问题，数组，文件程序，问题算法，小写数字转为大写数字，校验算法，硬币情况，字符，还有各种链表
C++ algorithm for Guinness, which contains the unit increases, the underlying programming, Tower of Hanoi, inverse matrix, find the binary, data structures, mathematical problems, array, documentation procedures, the problem algorithms, lower case to upper case figure numbers, calibration algorithm, coins situation, character, and various lists (2011-05-02, Visual C++, 621KB, 下载17次)
VC++演示LZARI压缩算法的使用效果，从事编程的朋友大概都听说过这个算法吧，据说压缩比还是可以的，虽然比不上WinRAR那么牛，但是在安全压缩方面也想当不错
VC++ demonstrates the use of effective compression algorithm LZARI engaged in programming the algorithm friends heard about it, said compression ratio is still possible, though not as WinRAR then the cattle, but also want to be good security compression (2011-04-19, Visual C++, 25KB, 下载1次)
实现统计字母频率，实现哈夫曼树的建立，并现实0 1代码，MFC GDI编程，还实现了发送，译码功能，接受，顺便还实现了聊天功能
Achieve statistical letter frequencies, to achieve the establishment of Huffman trees, and reality 01 code, MFC GDI programming, but also realized the sending, decoding functions to accept, by the way also achieved chat (2010-07-30, Visual C++, 2283KB, 下载13次)
编写的warshall算法、级别划分的算法的综合性算法。由于课程没要求进行编写区域划分算法，而区域划分是级别划分的前提，因此该算法中也把区域算法进行了编程实现
Prepared warshall algorithm, the algorithm-level partition algorithm integrated. As the program did not require the preparation of regional division algorithm, which is the level of division of the regional division of the premise, so the algorithm is also the regional programming algorithm (2010-05-23, Visual C++, 7KB, 下载2次)
编程求两个一元多项式的乘积。
输入
输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（整数）。
例如：1+2x+x2表示为：<1,0>,<2,1>,<1,2>,
输出
以指数递增的顺序输出乘积： <系数,指数>,<系数,指数>,<系数,指数>,
零多项式的输出格式为：<0,0>,
Programming seeking the product of two one-polynomial. Enter the input data for the two lines represent two unary polynomial. One dollar for each polynomial order of the exponential increase of the input polynomial coefficients (integer), index (integer). For example: 1+2 x+ x2 expressed as: " 1,0" , " 2,1" , " 1,2" , the output of the order of the exponential increase output of the product: " coefficient, index" , " coefficient, index" , " coefficient, the index " , zero polynomial output format is:" 0,0 " , (2009-12-16, Visual C++, 200KB, 下载16次)
算术表达式递归下降分析程序设计
编程实现给定算术表达式的递归下降分析器。
算术表达式文法如下：
E E+T | T
T T*F | F F (E) | i
Arithmetic expressions recursive descent analysis program design programming for a given arithmetic expression recursive descent parser. Arithmetic expression grammar is as follows: E E+ T | T T T* F | F F (E) | i (2009-12-04, Visual C++, 1KB, 下载9次)
指针是C和C++语言编程中最重要的概念之一，也是最容易产生困惑并导致程序出错的问题之一。利用指针编程可以表示各种数据结构, 通过指针可使用主调函数和被调函数之间共享变量或数据结构，便于实现双向数据通讯；并能像汇编语言一样处理内存地址，从而编出精练而高效的程序。指针极大地丰富了Ｃ和C++语言的功能。
Pointer is a C and C++ Language programming in the concept of one of the most important and most easily lead to confusion and lead to error, one of the issues. Pointer programming using a variety of data structure can be expressed through the main function pointer can be used and be transferred between the shared variable function or data structure, to facilitate the realization of two-way data communication and the same as the assembly language to deal with memory addresses, which prepared concise and efficient procedures. Pointer has greatly enriched the C and C++ Language functions. (2009-01-08, Visual C++, 197KB, 下载1次)
Problem F:汽车加油
Time Limit:1000MS Memory Limit:65536K
Total Submit:1400 Accepted:404
Language: not limited
Description
一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。
编程任务：
对于给定的n和k(k <= 10000)个加油站位置，编程计算最少加油次数。
Input
第一行有2 个正整数n和k，表示汽车加满油后可行驶n公里，且旅途中有k个加油站。接下来的1 行中，有k+1 个整数，表示第k个加油站与第
k-1 个加油站之间的距离。第0 个加油站表示出发地，汽车已加满油。第k+1 个加油站表示目的地。
Output
输出最少加油次数。如果无法到达目的地，则输出”No Solution”。
Sample Input
7 7
1 2 3 4 5 1 6 6
Sample Output
4
err (2008-02-29, Visual C++, 1KB, 下载12次)
数据结构c语言版 严蔚敏编写的很经典的附有答案
Data structure c language version prepared by Yan Wei-Min is very classic with the answers (2007-09-30, Visual C++, 4701KB, 下载114次)
/*数字三角形问题 问题描述： 给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法,计算出从三角形的顶至底的一条路径,使该路径经过的数字总和最大。 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 编程任务： 对于给定的由n行数字组成的数字三角形,编程计算从三角形的顶至底的路径经过的数字和的最大值
/* Digital triangle Issue Description : given an OK by the number n of triangular figures shown in the diagram below. Design of a test algorithm, calculated from the top of the triangle to the end of a path, the path through the largest sum of the figures. 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 programming tasks : for a given n line by the number of digits triangle, triangle programming calculated from the top to the bottom of the path through the figures and the maximum (2005-04-07, Visual C++, 1KB, 下载65次)