Count of Matches in Tournament
You are given an integer n, the number of teams in a tournament that has strange rules: Return the number of matches played in the tournament until a winner is decided.
You are given an integer n, the number of teams in a tournament that has strange rules:
Return the number of matches played in the tournament until a winner is decided.
Example 1
Input: n = 7
Output: 6
Explanation: Details of the tournament: - 1st Round: Teams = 7, Matches = 3, and 4 teams advance. - 2nd Round: Teams = 4, Matches = 2, and 2 teams advance. - 3rd Round: Teams = 2, Matches = 1, and 1 team is declared the winner. Total number of matches = 3 + 2 + 1 = 6.
Example 2
Input: n = 14
Output: 13
Explanation: Details of the tournament: - 1st Round: Teams = 14, Matches = 7, and 7 teams advance. - 2nd Round: Teams = 7, Matches = 3, and 4 teams advance. - 3rd Round: Teams = 4, Matches = 2, and 2 teams advance. - 4th Round: Teams = 2, Matches = 1, and 1 team is declared the winner. Total number of matches = 7 + 3 + 2 + 1 = 13.
Constraints
- 1 <= n <= 200
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.