IOM 2016, Блиц — Задача 47

Olympiad of Metropolises, Moscow. Blitz Contest, September, 5 · 5 септември 2016 г.

Условие

A computer program reads five integers of different magnitude and finds out their relative order, i.e. which one is the smallest, the second smallest etc. To this end, the program does pairwise comparisons on the integers.

What is the minimal number of comparisons that is always sufficient to complete this job? (Apparently, four comparisons is minimal, but not always sufficient, while comparing each integer against each other, i.e. 10 comparisons, is sufficient, but not minimal.)

Решение

---

Оригинал в Архива: blitz.pdf