Problem

Source: 2020 Turkey TST P3

Tags: combinatorics



66 dwarfs have a total of 111 hats. Each of the hats belongs to a dwarf and colored by 66 different colors. Festivities are organized where each of these dwarfs wears their own hat. There is no dwarf pair wearing the same colored hat in any of the festivities. For any two of the festivities, there exist a dwarf wearing a hat of a different color in these festivities. Find the maximum value of the number of festivities that can be organized.