IT-CESENATICO 2016 Problem 2
A mathematical contest had problems, each of which was given a score between and ( and included). It is known that, for any two contestants, there exists at most one problem in which they have obtained the same score (for example, there are no two contestants whose ordered scores are and , but there might be two contestants whose ordered scores are and ). Find the maximum number of contestants.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.