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

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

5 items

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

Special | 5 problems | 3/5 verified | Difficulty - | 3m 8s

# Problem Rating Tags Accepted Time ✓
A \u0418\u0433\u0440\u0430 \u0441 \u0448\u0430\u0440\u0438\u043a\u0430\u043c\u0438 28s
B Flappy Bird 1m 1s ✓
C \u0418\u0432\u0430\u043d \u0438 \u0434\u043e\u043c\u0430 40s ✓
D \u041e\u0431\u043c\u0435\u043d\u044b \u0440\u0435\u043a\u043e\u0440\u0434\u043e\u0432 39s ✓
E \u041f\u0440\u044f\u0442\u043a\u0438 \u043d\u0430 \u0434\u0435\u0440\u0435\u0432\u0435 20s
Practice › Codeforces Solutions › Высшая проба - 2025. Заключительный этап ›

CF 106180E - Прятки на дереве

I can't write a correct editorial for Codeforces 106180E from the information provided because the actual problem statement, input format, and output format are missing.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Высшая проба - 2025. Заключительный этап ›

CF 106180C - Иван и дома

We are given a set of intersections connected by directed roads. Each road can be traversed in its intended direction without cost, but if we go against the direction of a road, we must pay a penalty specific to that road.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Высшая проба - 2025. Заключительный этап ›

CF 106180D - Обмены рекордов

We are given a sequence that behaves like a list of “records” over time, where each element can be thought of as a score or a value attached to a position. Along with this, we are given a set of allowed exchange operations.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Высшая проба - 2025. Заключительный этап ›

CF 106180A - Игра с шариками

We are missing the actual statement for Codeforces 106180A - “Игра с шариками”. Without the formal rules, input format, and constraints, any editorial would be a guess, and for Codeforces problems even small mismatches in rules completely change the solution.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Высшая проба - 2025. Заключительный этап ›

CF 106180B - Flappy Bird

We are simulating a one-dimensional movement process through a sequence of columns. Each column defines a vertical corridor of allowed heights, and a bird moves from left to right across these columns. At any moment the bird occupies exactly one integer height.
codeforces competitive-programming Jun 20, 2026