里约热内卢举办了一场网球锦标赛，采用淘汰赛规则。题目要求找出冠军最多能参加多少场比赛。已知两名选手之间的比赛，必须满足一方已赛次数与另一方相差不超过1。输入为参赛人数n（2≤n≤10^18），输出冠军最多能参加的比赛数。例如，当n=2时，答案为1；n=3时，答案为2；n=4时，答案为2，因为冠军最多只能与2名选手比赛，之后无法满足比赛规则。
C. Tennis Championship
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if someone loses a game he leaves the tournament immediately.
Organizers are still arranging tournament grid (i.e. the order games will happen and who is going to play with whom) but they have already fixed one rule: two players can play against each other only if the number of games one of them has already played differs by no more than one from the number of games the other one has already played. Of course, both players had to win all their games in order to continue participating in the tournament.
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
