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

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

4 items

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

Special | 4 problems | 0/4 verified | Difficulty - | 3m 56s

#	Problem	Time
A	\u0424\u0440\u0438\u0440\u0435\u043d \u0438 \u0433\u0440\u0438\u043c\u0443\u0430\u0440\u044b	1m 23s
B	\u0424\u0440\u0438\u0440\u0435\u043d \u0438 \u0431\u0430\u0440\u044c\u0435\u0440	35s
C	\u0424\u0440\u0438\u0440\u0435\u043d \u0438 \u0438\u043d\u0442\u0435\u0440\u0435\u0441\u043d\u044b\u0435 \u0432\u043e\u043f\u0440\u043e\u0441\u044b	1m 25s
D	Historic Memories	33s

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

CF 104959C - Фрирен и интересные вопросы

We are given a long sequence of years, each year carrying two integer values: one describing the number of “good” events and another describing the number of “bad” events. Two years can be related in two different direct ways.

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

CF 104959A - Фрирен и гримуары

We are given a collection of grimoirs, each one carrying two attributes: a difficulty value and a potential value. The order in which they were purchased is fixed and matters as a final tie-breaker. At each of $n$ moments, we must select exactly one unused grimoir.

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

CF 104959D - Historic Memories

The continent is a tree of cities. Traveling along any road takes exactly one year, and because the graph is a tree there is a unique simple path between any two cities.

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

CF 104959B - Фрирен и барьер

Codeforces 104959B: Фрирен и барьер