Интернет-олимпиады, Сезон 2025-2026, Первая личная олимпиада

4 problems from Интернет-олимпиады, Сезон 2025-2026, Первая личная олимпиада (contest 106352), difficulty -. 4/4 solutions verified against sample I/O.

4 items

Интернет-олимпиады, Сезон 2025-2026, Первая личная олимпиада

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

#	Problem	Time	✓
A	\u0422\u0443\u0440\u043d\u0438\u0440 \u0432 \u0417\u0432\u0435\u0440\u043e\u043f\u043e\u043b\u0438\u0441\u0435	57s	✓
B	\u0422\u0440\u0435\u043d\u0438\u0440\u043e\u0432\u043a\u0430 \u043f\u043e \u043f\u0435\u0439\u043d\u0442\u0431\u043e\u043b\u0443	48s	✓
C	\u041f\u043e\u0433\u043e\u043d\u044f \u0437\u0430 \u043f\u0430\u0442\u0435\u043d\u0442\u043e\u043c	1m 8s	✓
D	\u0420\u0430\u0431\u043e\u0447\u0438\u0435 \u043f\u0430\u0440\u044b \u0432 \u0417\u0432\u0435\u0440\u043e\u043f\u043e\u043b\u0438\u0441\u0435	1m 12s	✓

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Первая личная олимпиада ›

CF 106352D - Рабочие пары в Зверополисе

We are given a list of integers, each representing a “worker” in Zveropolis. For every worker, we must choose a different partner from the same list so that a specific interaction score is maximized.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Первая личная олимпиада ›

CF 106352A - Турнир в Зверополисе

We are given a sequence of matches played by Judy. We only know how many times she won, drew, and lost, but not the order of those games.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Первая личная олимпиада ›

CF 106352B - Тренировка по пейнтболу

We are given a sequence of paintballs, each characterized by a time moment when it flies and a vertical position (a row on a wall). The wall has height h, and rows are numbered from bottom to top. Each paintball exists only at its given time and affects exactly one row.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Первая личная олимпиада ›

CF 106352C - Погоня за патентом

We are given a sequence of numbers placed on a line of safes. Each safe carries an integer label, and that label is only important through its prime divisors.