Интернет-олимпиады, Сезон 2024-2025, Третья личная олимпиада

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

4 items

Интернет-олимпиады, Сезон 2024-2025, Третья личная олимпиада

Special | 4 problems | 4/4 verified | Difficulty - | 3m 57s

#	Problem	Time	✓
A	\u0417\u0430\u0433\u043e\u043d \u0434\u043b\u044f \u0434\u0440\u0430\u043a\u043e\u043d\u043e\u043e\u0441\u043b\u0438\u043a\u043e\u0432	55s	✓
B	\u041c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a\u0430 \u0434\u043b\u044f \u0417\u0435\u0440\u043a\u0430\u043b\u0430	50s	✓
C	\u0417\u0430\u0431\u044b\u0432\u0447\u0438\u0432\u044b\u0439 \u041e\u0441\u0435\u043b	1m 28s	✓
D	\u0417\u0430\u0434\u0430\u0447\u0430 \u041b\u0435\u0441\u041a\u043b\u0430\u0441\u0441\u0428\u043a\u043e\u043b\u044b	44s	✓

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

CF 106200D - Задача ЛесКлассШколы

We are given a sequence of non-negative integers, and we are allowed to optionally apply a digit-reversal operation to any element. Each number can be reversed independently, but only once. After performing these choices, we obtain a final array, and we want to maximize its mex.

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

CF 106200B - Математика для Зеркала

We are given a geometric progression defined by its first term and ratio. Concretely, the sequence is A: q, q·r, q·r², q·r³, and so on, continuing infinitely.

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

CF 106200C - Забывчивый Осел

We are given several groups of gnomes, each group having a fixed size, and several royal courts, each requiring a delegation of a specified size.

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

CF 106200A - Загон для драконоосликов

We are given several axis-aligned rectangles, and each rectangle has its bottom-left corner fixed at the origin while the top-right corner is given as $(wi, hi)$. So each input pair defines a rectangle that covers all points $(x, y)$ such that $0 le x le wi$ and $0 le y le hi$.