超市计价管理系统

自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the method, using the right expression Segmentation and recursive input, and this was also a Polish integrity of the conversion process, sound

功能：四阶幻方全解 运算时间：3、40秒 结果：7040个 环境：Visual Studio.net 2003的vc++的控制台项目-Function: fourth-order magic square-wide computing solutions Time: 3,40 seconds Results: 7040 Environment: Visual Studio.net 2003 the vc++ Console project

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

运用apache的poi读取excel表格内容，将读取出来的数据插入db2数据库。-The poi using apache to read the contents of excel table, will read out the data into db2 database.

编程求两个一元多项式的乘积。 输入 　　输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（整数）。 　　例如：1+2x+x2表示为：,,, 输出 　　以指数递增的顺序输出乘积： ,,, 　　零多项式的输出格式为：,-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 " ,

这是由DELPHI7.0开发的一个商品销售系统，里面有齐全的源代码-This is DELPHI7.0 developed a merchandising system, which has complete source code

prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.

本系统服务的对象不仅是管理人员，还包括注册用户。因此本系统分为两个大的模块，一是用户模块，二是管理人员模块。用户在登陆页面选择注册，注册一个自己的账号，才能进入用户模块。用户模块向用户查提供了宿舍信息查询方式，用于不同要求的查询方法。用户可通过查询界面输入所需要的学生或者宿舍的信息，经过数据库内数据的筛选，可以得到所查询的结果。管理人员通过输入帐号及密码可进入管理人员模块。该模块有查询模块、管理员管理、宿舍调度管理。管理人员可以应实际要求，对学生、宿舍等数据进行添加、删除、修改操作。  

Vc++编写的对ODBC数据库操作的源代码。-Vc++ Prepared ODBC database operations on the source code.

基于SDL的关于二叉树计算的源代码，是TXT的一些程序-SDL-based binary tree calculated on the source code, are some of the procedures TXT