[Hacker Earth] Stuck in an Infinite GridRead more
[Hacker Earth] Unequal GoodnessRead more
[Hacker Earth] GameRead more
[Hacker Earth] Numbers IIRead more
[Codeforces] Round 208 (Div. 2) C. Dima and ContainersRead more
[Codeforces] Round 209 (Div. 2) D. Pair of NumbersRead more
[Codeforces] Round 210 (Div. 1) B. Levko and ArrayRead more
[Codeforces] Round 214 (Div. 2) D. Dima and Trap GraphRead more
[Codeforces] Round 215 (Div. 1) C. Sereja and the Arrangement of NumbersRead more
[LeetCode] Count of Matches in Tournament

1688. Count of Matches in Tournament

You are given an integer n, the number of teams in a tournament that has strange rules:

  • If the current number of teams is even, each team gets paired with another team. A total of n / 2 matches are played, and n / 2 teams advance to the next round.
  • If the current number of teams is odd, one team randomly advances in the tournament, and the rest gets paired. A total of (n - 1) / 2 matches are played, and (n - 1) / 2 + 1 teams advance to the next round.

Return the number of matches played in the tournament until a winner is decided.

Read more