IOM 2016, Блиц — Задача 69
Olympiad of Metropolises, Moscow. Blitz Contest, September, 5 · 5 септември 2016 г.
Условие
Messages that are transferred through a communication channel only contain letters A, B, C, D, E, F. Binary code is used for transferring, and this code allows for unambiguous decoding. For letters A, B, C code words are A: 11, B: 101, C: 0. What is the minimal possible sum of code lengths of D, E and F codes if the code always allows for unambiguous decoding?
Решение
Внимание: Непълно решение
В архива няма официално решение на тази задача.
Оригинал в Архива: blitz.pdf