-
Task1-trial--10211281--zly
描述：足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数；普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序，实现对众多足球俱乐部管理的基本功能。具体功能包括：
a) 俱乐部的增删改查，俱乐部的属性包括名称、现金、其下人员；
b) 可以对所有球员的各项属性进行简单搜索，支持输入多个条件，条件之间用&&连接，例如：
i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”，查询表达式：!(@age>25) && @experience>5 && @kick>100
c) 支持球员在不同俱乐部间的买卖，买卖需符合以下条件：作为买方的俱乐部的现金>=球员的转会费，交易完成后，卖方将得到转会费。
要求：
d) 必须采用面向对象的方式，使用类组织数据结构，并注意类的继承关系；
e) 在题目要求基础上可以自行扩展功能，提供扩实用扩展功能者适当加分（加分不超过5分）。
(Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include:
a) the club CRUD, the name of the club s property, including cash, under which personnel
b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example:
i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100
c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl)
- 2013-08-20 10:09:29下载
- 积分：1
-
fast_sort
/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边，
*基准值为一组，这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high，即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分：1
-
zhan
队列的顺序存储结构和操作实现
队列的顺序存储结构和操作实现(The order of the queue storage structure and operation of the order of the realization of the queue storage structure and operation of the realization of)
- 2008-12-11 20:10:49下载
- 积分：1
-
Circlist_Josephus3_4
循环链表的应用
循环链表的应用
很方便的实现(cycle Chain cyclic chain of convenience Implementation)
- 2006-11-23 19:36:47下载
- 积分：1
-
duilie
队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)
- 2010-09-08 14:36:38下载
- 积分：1
-
point
用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
- 2012-12-16 13:14:04下载
- 积分：1
-
SelectSort
选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
- 2012-09-27 22:38:22下载
- 积分：1
-
1
说明： 贪婪算法的简单描述 不过没做完 只是想下个程序 用用。。。。
(greed math)
- 2012-04-26 19:56:56下载
- 积分：1
-
test
使用vc编写的一个动态链接库，测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
- 2010-05-28 23:27:09下载
- 积分：1
-
Campus-navigation-problem
校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。
要求：
（1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。
（2）为来访客人提供图中任意景点相关信息的查询。
（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。
（4）修改景点信息。
(Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path).
Requirements:
(1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information.
(2) the figure for visiting any sites offering information about the query.
(3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites.
(4) modify the attractions information.)
- 2011-08-12 10:34:14下载
- 积分：1
