MathDB
candies for those who solve correctly problems

Source: St. Petersburg 2019 10.5

May 1, 2019
combinatoricsminimum

Problem Statement

A class has 2525 students. The teacher wants to stock NN candies, hold the Olympics and give away all NN candies for success in it (those who solve equally tasks should get equally, those who solve less get less, including, possibly, zero candies). At what smallest NN this will be possible, regardless of the number of tasks on Olympiad and the student successes?