MathDB
2013 ToT Fall Junior O p1 100 participants in a wrestling tournament

Source:

March 22, 2020
combinatorics

Problem Statement

In a wrestling tournament, there are 100100 participants, all of different strengths. The stronger wrestler always wins over the weaker opponent. Each wrestler fights twice and those who win both of their fights are given awards. What is the least possible number of awardees?