您好我碰到这个问题，我的朋友。

Hi I came across this question from my friend.

给我一个通用的公式找到多少网球比赛（单打），需要n个球员？

Give me a generalised formula to find how many tennis matches (singles) are required for n players ?

例如：如果球员的数量是16个，

Example : if the number of players are 16 then

第一：我们需要8 mataches（16玩家），这里8名选手将被淘汰，8名选手将在那里

first : we need 8 mataches (for 16 players) , here 8 players will be eliminated and 8 players will be there

SE code：我们需要4场比赛（8玩家），在这里再次4名选手将被淘汰和4将剩余

secode : we need 4 matches (for 8 players) , here again 4 players will be eliminated and 4 will be remaining

第三：  我们需要2场比赛（4播放器），在这里再次2名球员将被淘汰和2  将剩余

third : we need 2 matches (for 4 players) , here again 2 players will be eliminated and 2 will be remaining

决赛：   我们需要1 macth决定2名球员之间的胜者

Final : we need 1 macth to decide a winner among the 2 players

那么完全15场比赛是必需的。

so totally 15 matches are required.

我需要一个通用的公式发现，这样如果我给n的值，我应该去寻找获奖者需要的匹配数

I need a generalised formula to find , such that if I give the value n I should get the number of matches required to find the winner

n可以是奇数或偶数

推荐答案

有关消除类游戏，匹配的数目总是n-1，因为一个球员会后一场比赛和n-1选手都在被淘汰被淘汰总和。

For elimination game, the number of matches is always n-1, because one player will be eliminated after one game and n-1 players have to be eliminated in total.