Given an integer M which is the number of matches played in a tournament and each participating team has played a match with all the other teams. The task is to find how many teams are there in the tournament.
Input: M = 3
If there are 3 teams A, B and C then
A will play a match with B and C
B will play a match with C (B has already played a match with A)
C has already played matches with team A and B
Total matches played are 3
Input: M = 45
Approach: Since each match is played between two teams. So this problem is similar to selecting 2 objects from Given N objects. Therefore the total number of matches will be C(N, 2), where N is the number of participating teams. Therefore,
M = C(N, 2)
M = (N * (N – 1)) / 2
N2 – N – 2 * M = 0
This is a quadratic equation of type ax2 + bx + c = 0. Here a = 1, b = -1, c = 2 * M. Therefore, applying formula
x = (-b + sqrt(b2 – 4ac)) / 2a and x = (-b – sqrt(b2 – 4ac)) / 2a
N = [(-1 * -1) + sqrt((-1 * -1) – (4 * 1 * (-2 * M)))] / 2
N = (1 + sqrt(1 + (8 * M))) / 2 and N = (1 – sqrt(1 + (8 * M))) / 2
After solving the above two equations, we’ll get two values of N. One value will be positive and one negative. Ignore the negative value. Therefore, the number of teams will be the positive root of the above equation.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.