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

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

4 items

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

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

#	Problem	Time	✓
A	\u041f\u0440\u043e\u0432\u0435\u0440\u043a\u0430 \u0441\u043e\u0441\u0442\u043e\u044f\u043d\u0438\u044f	56s	✓
B	\u0412\u044b\u0431\u043e\u0440 \u0432\u0435\u0440\u0441\u0438\u0439 \u043a\u043e\u043c\u043f\u043e\u043d\u0435\u043d\u0442\u043e\u0432	1m 8s	✓
C	\u041f\u043e\u043b\u0438\u0446\u0438\u044f 2099	50s	✓
D	\u0422\u0432\u043e\u0440\u0435\u0446 \u0432\u043e\u0441\u043f\u043e\u043c\u0438\u043d\u0430\u043d\u0438\u0439	49s	✓

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

CF 106199D - Творец воспоминаний

We are simulating a process of placing small fixed shapes into a large grid, where the grid behaves like a physical system: cells get filled, whole rows disappear when completely filled, and everything above a removed row collapses downward.

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

CF 106199C - Полиция 2099

We are given a rooted tree of employees. Employee 1 is the root, and every other employee has exactly one direct manager with a smaller index, so the structure is a rooted tree. Each node carries a label, a single lowercase letter representing that employee’s specialty.

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

CF 106199B - Выбор версий компонентов

We are given a system of $n$ components, each of which must be assigned a non-negative integer value $di$. These values are not independent. There are directed constraints between pairs of components.

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

CF 106199A - Проверка состояния

We are given an array of integers and asked to compare two expressions built from it. The first expression takes the greatest common divisor of all array elements and then applies factorial to that result.