登录
首页 » Visual C++ » Task1-trial--10211281--zly

Task1-trial--10211281--zly

于 2013-08-20 发布 文件大小:1492KB
0 244
下载积分: 1 下载次数: 8

代码说明:

  描述:足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数;普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序,实现对众多足球俱乐部管理的基本功能。具体功能包括: 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)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 算法集锦
    数据结构算法集锦:包括大量常用算法,如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
    2005-06-28 19:55:07下载
    积分:1
  • 0712233
    数据结构c语言版,图的遍历,周游世界,无向图的遍历,包含14个国家。(Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.)
    2009-12-20 17:04:09下载
    积分:1
  • Bigint
    利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
    2007-10-18 21:34:06下载
    积分:1
  • LINKLIST
    单链表的增删查改功能,可以实现单链表的创建、传入数据;并能实现对已有单链表的插入数据、删除数据等功能。(Single linked list of additions and deletions check change function, you can achieve the creation of a single list, incoming data insert data of existing single linked list, delete data and functions.)
    2012-10-31 21:03:50下载
    积分:1
  • maze
    通过学习奥赛培训课程,利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)
    2010-09-02 21:43:32下载
    积分:1
  • luowenfeng
    建立试题库文件,随机产生n个题目; 题目涉及加减乘除,带括弧的混合运算; 利用栈求解表达式的值; 随时可以退出; 保留历史分数,能回顾历史,给出与历史分数比较后的评价( The establishment of test database file, the subject of n randomly generated topics related to addition, subtraction, mixed operations with parentheses use the value of the expression stack solution ready to quit to preserve the historical scores, can look back at history, and history gives the comparison of scores Evaluation 保留历史分数,能回顾历史,给出与历史分数比较后的评价)
    2020-12-29 23:09:01下载
    积分:1
  • floy
    floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)
    2007-11-13 23:39:25下载
    积分:1
  • sort
    归并排序,复习排序算法,在不同环境下,寻找时间复杂度最少的排序算法( Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)
    2013-11-05 22:15:57下载
    积分:1
  • Birch
    这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)
    2012-05-08 09:00:44下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载