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

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

5 items

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

Special | 5 problems | 4/5 verified | Difficulty - | 5m 16s

# Problem Rating Tags Accepted Time ✓
A \u041d\u0430\u0431\u0440\u0430\u0442\u044c \u0441\u0443\u043c\u043c\u0443 \u0434\u0435\u043d\u0435\u0433 1m 1s ✓
B \u0412\u0435\u043b\u043e\u0434\u043e\u0440\u043e\u0436\u043a\u0438 1m 19s ✓
C \u041d\u0430\u043b\u043e\u0433 29s
D \u0411\u043b\u0438\u0437\u043a\u0438\u0435 \u0441\u0442\u0440\u043e\u043a\u0438 1m 30s ✓
E \u041e\u0447\u0435\u043d\u044c \u0441\u0442\u0440\u0430\u043d\u043d\u044b\u0435 \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u0438 57s ✓
Practice › Codeforces Solutions › Высшая проба - 2022. Заключительный этап ›

CF 104963D - Близкие строки

We are given a collection of strings, and for each string we must choose another string from the same collection that is “closest” under a custom distance.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2022. Заключительный этап ›

CF 104963B - Велодорожки

We are given a rectangular plaza made of unit squares, with width $w$ and height $h$. Some of these unit cells are cracked and must be removed entirely during construction.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2022. Заключительный этап ›

CF 104963C - Налог

We are given a collection of apartments, each with an initial area. Daniil can reduce the area of any apartment by repeatedly applying an operation: choose a factor $y$, pay $y$ coins, and divide the current area by $y$, but only if the result remains an integer.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2022. Заключительный этап ›

CF 104963E - Очень странные операции

We are maintaining a multiset of large non-negative integers under three kinds of operations, and after each operation we must report the bitwise XOR of all current elements. The operations are dynamic in two different ways.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Высшая проба - 2022. Заключительный этап ›

CF 104963A - Набрать сумму денег

We are asked to count how many different ways a fixed amount of money $N$ can be paid exactly using banknotes of denominations 50, 100, and 200, where each denomination can be used any number of times.
codeforces competitive-programming Jun 28, 2026