MathDB

One hundred tennis players took part in a tournament where they played with each other exactly one game, with no draws. At the end of the tournament a table (ranking) is formed depending on the number of victories. It is known that one tennis player finished the tournament on

k

-th place and is the only one with that number of victories, and he has beaten every tennis player who is placed above him in the table and lost to anyone ranked weaker than him on the table. Find the smallest value of

k

Problem Statement