参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目，项目编号分别为 和 。由于各项目参加人数差别较大，有些项目取前五名，得分顺序为7，5，3，2，...

选择AL2格式文件，修改代码可以插入txt文件等等，解析文件赋值实体，格式固定，转而插入ORACLE数据库记录

数据结构中著名的汉诺塔问题的实现，基于C++实现-Data structure of the famous Tower of Hanoi problem to achieve, based on C++ implementation

每个RFC 3261信息头有一个相应的存取标识. 但是,许多信息头拥有同样的形式。 例如。To和From的信息头都是由显示名和一个URI组成。 To和From信息头用来管理与处理NameAddr实例的. 这个类管理每个信息头类型来负责 解析信息头文本，倘若存储和存取在信息的生存期间,和序列化信息头值为翻译的文本。 下面的表显示了reSIP当前支持的每个RFC信息头的reSIP类型。 reSIP类型是一个SIP信息的信息头调用存取标识作为它的参数的返回类型。-each RFC 3261 header is a corresponding access logo. However, many information first with the same form. For example. To and From the information revealed by the first name and a URI component. To and From the first information for the management and disposal of NameAddr examples. The management of each category of information for the first type of analytical information to the first version, if the storage and access of information in the survival period, and sequence information for the first value of the text translation. The following table shows the current reSIP support of each of the first RFC information reSIP types. ReSIP type of information is a SIP call the first access to information as its logo to the return parameter types.

数据结构实验之一，对顺序表进行的增删查改，交过的-Experimental data structure one of the chronological table of the additions and deletions to search, pay-off

我们的作业题，队列和栈函数，对理解这两个概念有帮助-Our operating title, queue and stack functions, understanding these two concepts help

C++数据结构树结构类定义及有关算法-C data structure tree structure type definition and the algorithm

数据结构常用算法程序集1，描述数据结构算法。-data structure used an algorithm set procedures described algorithm data structure.

设置信号放大器，在包中有详细的代码说明及注释，通过树的数据结构实现信号放大器的设置~-Set-signal amplifier, in the package are detailed code descriptions and notes, through the tree data structure to achieve signal amplifier settings ~

魔王的语言，运用了数据结构栈、队列的结构-Devil" s language, the use of the data structure stack, queue structure

本演示程序演算约瑟夫环问题，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-The demo program Joseph Central calculus problem, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure should be able to automatically save a list of the serial number of people and held out the password given to m, again as reported maximum number of such cycles, until all that far out.