Sports meeting project management system, set up to manage the school sports meet project related information, information about school sports projects include: sports, school name, subtests, single rank, grade, total ranking, etc., the specific requirements:
(1) set up the storage structure,
(2) the school sports meeting project related information,
(3) to find a sports project related information,
(4) modify some games project related information,
(5) delete a sports project and related information,
(6) to calculate each sports project school grades ranking,
(7) statistics for all projects total grade of each college, and rank,
[programming tips] will each games project as a node, a type of structure, structure contained in the sports project relevant information and node pointer, suppose you have 10 college, sports project node structure defined for

Struct node
{char xiangmu [40]. Match the project name/* */
Char name [10] [40]./* college name */
Float score [10]./* subtests */
Int no [10];/* single rank */
Struct node * link; Pointer to the next course node */*/
};

Statistical total grade of each college should start sequential search, according to the college name from the node we compare college name string comparison function STRCMP (), delete node of specified event, the first thing to find according to sports, if not found, didn't find the information output, if found, is discussed in three conditions: the nodes for the head, modify the original head node points to nodes for a new head; When the nodes for the middle and modify the nodes of the previous pointer to point to the node after a node; When the nodes for the tail, modify the original nodes for the new tail end node of the previous; Finally release the node, after perform the delete operation, continue to cycle to find qualified until the linked list of nodes,

CodePudding user response:

Had better write their own, where I went wrong to ask again, not many people are willing to write so much code

CodePudding user response:

refer to the original poster weixin_48570556 response:

sports meeting project management system, set up to manage the school sports meet project related information, information about school sports projects include: sports, school name, subtests, single rank, grade, total ranking, etc., the specific requirements:
(1) set up the storage structure,
(2) the school sports meeting project related information,
(3) to find a sports project related information,
(4) modify some games project related information,
(5) delete a sports project and related information,
(6) to calculate each sports project school grades ranking,
(7) statistics for all projects total grade of each college, and rank,
[programming tips] will each games project as a node, a type of structure, structure contained in the sports project relevant information and node pointer, suppose you have 10 college, sports project node structure defined for

Struct node
{char xiangmu [40]. Match the project name/* */
Char name [10] [40]./* college name */
Float score [10]./* subtests */
Int no [10];/* single rank */
Struct node * link; Pointer to the next course node */*/
};

Statistical total grade of each college should start sequential search, according to the college name from the node we compare college name string comparison function STRCMP (), delete node of specified event, the first thing to find according to sports, if not found, didn't find the information output, if found, is discussed in three conditions: the nodes for the head, modify the original head node points to nodes for a new head; When the nodes for the middle and modify the nodes of the previous pointer to point to the node after a node; When the nodes for the tail, modify the original nodes for the new tail end node of the previous; Finally release the node, after perform the delete operation, continue to cycle to find qualified until the linked list of nodes,

Ah, don't you go out to work later still to the woo code above?
Everyone is very busy, which have time to help you,
PS: that's a lot of code to 20 points

CodePudding user response:

refer to the original poster weixin_48570556 response:

sports meeting project management system, set up to manage the school sports meet project related information, information about school sports projects include: sports, school name, subtests, single rank, grade, total ranking, etc., the specific requirements:
(1) set up the storage structure,
(2) the school sports meeting project related information,
(3) to find a sports project related information,
(4) modify some games project related information,
(5) delete a sports project and related information,
(6) to calculate each sports project school grades ranking,
(7) statistics for all projects total grade of each college, and rank,
[programming tips] will each games project as a node, a type of structure, structure contained in the sports project relevant information and node pointer, suppose you have 10 college, sports project node structure defined for

Struct node
{char xiangmu [40]. Match the project name/* */
Char name [10] [40]./* college name */
Float score [10]./* subtests */
Int no [10];/* single rank */
Struct node * link; Pointer to the next course node */*/
};

Statistical total grade of each college should start sequential search, according to the college name from the node we compare college name string comparison function STRCMP (), delete node of specified event, the first thing to find according to sports, if not found, didn't find the information output, if found, is discussed in three conditions: the nodes for the head, modify the original head node points to nodes for a new head; When the nodes for the middle and modify the nodes of the previous pointer to point to the node after a node; When the nodes for the tail, modify the original nodes for the new tail end node of the previous; Finally release the node, after perform the delete operation, continue to cycle to find qualified until the linked list of nodes,

This is not a c + +?
This is C