Problem

Source: Bulgaria JBMO TST 2017 P3 day 1

Tags: combinatorics proposed, combinatorics



Given are sheets and the numbers $00, 01, \ldots, 99$ are written on them. We must put them in boxes $000, 001, \ldots, 999$ so that the number on the sheet is the number on the box with one digit erased. What is the minimum number of boxes we need in order to put all the sheets?