Высшая проба - 2021. Заключительный этап

5 problems from Высшая проба - 2021. Заключительный этап (contest 104962), difficulty -. 3/5 solutions verified against sample I/O.

5 items

Высшая проба - 2021. Заключительный этап

Special | 5 problems | 3/5 verified | Difficulty - | 6m 40s

# Problem Rating Tags Accepted Time ✓
A \u041a\u0440\u0443\u0433\u043b\u044b\u0439 \u0413\u0440\u0430\u0444 55s ✓
B \u0418\u0433\u0440\u0430 \u0432 \u0441\u043f\u0438\u0447\u043a\u0438 56s ✓
C \u0411\u0438\u0442\u043e\u0432\u0430\u044f \u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u043a\u0430 1m 12s ✓
D Run, Pancake, Run 2m 2s
E \u041c\u0435\u0442\u0440\u043e 1m 35s
Practice › Codeforces Solutions › Высшая проба - 2021. Заключительный этап ›

CF 104962C - Битовая сортировка

We are given several independent test cases. In each one, we receive a list of integers, all written using exactly k binary bits. The value of each number is therefore in the range from 0 to 2^k - 1.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2021. Заключительный этап ›

CF 104962D - Run, Pancake, Run

We are given a tree of rooms. Each room initially contains a fixed number of pancakes, and every corridor between two rooms also contains pancakes.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2021. Заключительный этап ›

CF 104962E - Метро

We are given a straight line of metro stations connected by consecutive segments, where segment $i$ connects station $i$ and $i+1$ and has a travel cost $ci$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2021. Заключительный этап ›

CF 104962B - Игра в спички

We are given a number of identical sticks, and the task is to form rectangular grid structures using exactly all of them. A grid of size $n times m$ is a rectangle subdivided into unit squares, where every unit edge in the grid is represented by a stick.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2021. Заключительный этап ›

CF 104962A - Круглый Граф

We are given a cycle of n houses. Each house is placed on a circle, so every house has a natural notion of moving left or right along the cycle. We are allowed to choose a parameter k.
codeforces competitive-programming Jun 28, 2026