RU-ALLRUSSIAN 1983 Problem 12
A word is a finite string of As and Bs. Can we find a set of three 4- letter words, ten 5- letter words, thirty 6- letter words and five 7- letter words such that no word is the beginning of another word. [For example, if ABA was a word, then ABAAB could not be a word.]
Dataset text NuminaMath olympiads. 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.