In a championship n (max 20) teams play form (max 20) days. The outcome of in a matrix of n x m integers, each of which can only be either 0, 1 or 3. Each i-th row of the matrix represents the points acquired by the i-th team in the m days of the championship. Each j-th column of the matrix represents the points acquired by the n teams in the matches of the j-th day. The points acquired are 3 for a won game, 1 for tied and 0 for a defeat, respectively. Write a C function with the following prototype: void displRanking (int C[MAXN][MAXM], int n, int m); For each matchday of the championship, the function should print on the screen the index (i.e., the cor- responding row number) of the team that is currently leading the championship (i.e., the team that has the highest sum of points since the beginning of the championship). In case there is more than one leading team, it should print the first that is found. Example: Given the following matrix with n- and m-3 3 1 0. 1. 1. 1 1 1. The outout should be: The leading team in each of the 3 matchdays is: 0 03
In a championship n (max 20) teams play form (max 20) days. The outcome of in a matrix of n x m integers, each of which can only be either 0, 1 or 3. Each i-th row of the matrix represents the points acquired by the i-th team in the m days of the championship. Each j-th column of the matrix represents the points acquired by the n teams in the matches of the j-th day. The points acquired are 3 for a won game, 1 for tied and 0 for a defeat, respectively. Write a C function with the following prototype: void displRanking (int C[MAXN][MAXM], int n, int m); For each matchday of the championship, the function should print on the screen the index (i.e., the cor- responding row number) of the team that is currently leading the championship (i.e., the team that has the highest sum of points since the beginning of the championship). In case there is more than one leading team, it should print the first that is found. Example: Given the following matrix with n- and m-3 3 1 0. 1. 1. 1 1 1. The outout should be: The leading team in each of the 3 matchdays is: 0 03
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
This is not a graded question so please don't disregard it as if it is. Thank you in advance professor!
![In a championship n (max 20) teams play for m (max 20) days. The outcome of the matches are stored
in a matrix of n x m integers, each of which can only be either 0, 1 or 3. Each i-th row of the matrix
represents the points acquired by the i-th team in the m days of the championship. Each j-th column
of the matrix represents the points acquired by the n teams in the matches of the j-th day. The points
acquired are 3 for a won game, 1 for tied and 0 for a defeat, respectively.
Write a C function with the following prototype:
void displRanking (int C[MAXN) [MAXM], int n, int m);
For each matchday of the championship, the function should print on the screen the index (i.e., the cor-
responding row number) of the team that is currently leading the championship (i.e., the team that has
the highest sum of points since the beginning of the championship). In case there is more than one leading
team, it should print the first that is found.
Example:
Given the following matrix with n-4 and m-3
3 1
1.
1
The outout should be:
The leading team in each of the 3 matchdays is: 0 0 3](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fcb8f6e2b-ec9f-4b10-9a5f-eb45a5b606fb%2Fa7d4168b-18d6-4e0e-bf1c-b8218e622944%2Flankk1c_processed.jpeg&w=3840&q=75)
Transcribed Image Text:In a championship n (max 20) teams play for m (max 20) days. The outcome of the matches are stored
in a matrix of n x m integers, each of which can only be either 0, 1 or 3. Each i-th row of the matrix
represents the points acquired by the i-th team in the m days of the championship. Each j-th column
of the matrix represents the points acquired by the n teams in the matches of the j-th day. The points
acquired are 3 for a won game, 1 for tied and 0 for a defeat, respectively.
Write a C function with the following prototype:
void displRanking (int C[MAXN) [MAXM], int n, int m);
For each matchday of the championship, the function should print on the screen the index (i.e., the cor-
responding row number) of the team that is currently leading the championship (i.e., the team that has
the highest sum of points since the beginning of the championship). In case there is more than one leading
team, it should print the first that is found.
Example:
Given the following matrix with n-4 and m-3
3 1
1.
1
The outout should be:
The leading team in each of the 3 matchdays is: 0 0 3
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY