sdgbf dChAT SDB

参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目，项目编号分别为 和 。由于各项目参加人数差别较大，有些项目取前五名，得分顺序为7，5，3，2，1；还有些项目只取前三名，得分顺序为5，3，2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单，内容包括各校所取得的每项成绩的项目号、名次（成绩）、姓名和得分；产生团体总分报表，内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据：对于 ， ， ，编号为奇数的项目取前五名，编号为偶数的项目取前三名，设计一组实例数据。 -The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report ,

最小生成树问题用lingo9.0程序实现-Minimum spanning tree problem lingo9.0 procedures used to achieve

这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.

一个短小精悍的PARADOX数据文件DB的修复工具，能修复绝大多数损坏的DB文件。-a small and PARADOX DB data file repair tool to repair damage to the majority of DB documents.

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

Qt对数据库操作，包括数据库打开与关闭，增加、删除、修改、查询，其中数据的展示是用自定义数据模型，是从QAbstractTableModel继承起的。

堆栈的应用及操作 利用堆栈实现对任意进制的数的转换；-stack

最段路径的算法 dijkstra算法，用C++编写-The dijkstra algorithm path segment algorithm, using C++ to prepare

基于c#.net编写的酒店管理系统 里面附带数据库 能完成普通酒店需要的所有功能

Java写的TDS协议(JDBC/ODBC)实现-Java to write the TDS protocol (JDBC/ODBC) to achieve