Когнитивные технологии. Финал 2024

11 problems from Когнитивные технологии. Финал 2024 (contest 105490), difficulty -. 2/11 solutions verified against sample I/O.

11 items

Когнитивные технологии. Финал 2024

Special | 11 problems | 2/11 verified | Difficulty - | 5m 50s

#	Problem	Time	✓
A	\u041b\u043e\u0433\u043e\u0442\u0438\u043f VK	30s
B	LCA-\u0441\u0443\u043c\u043c\u0430	48s	✓
C	\u041c\u0430\u0434\u043e\u043a\u0430 \u0438 \u043f\u043e\u0440\u0432\u0430\u043d\u043d\u044b\u0439 \u0444\u043e\u0442\u043e\u0430\u043b\u044c\u0431\u043e\u043c	1m 2s	✓
D	\u041e\u0447\u0435\u0440\u0435\u0434\u043d\u0430\u044f \u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u043a\u0430 \u043f\u0435\u0440\u0435\u0441\u0442\u0430\u043d\u043e\u0432\u043a\u0438	26s
E	\u0421\u0447\u0438\u0442\u0430\u0435\u043c \u0437\u0432\u0435\u0437\u0434\u044b	26s
F	\u0413\u043e\u0440\u0438\u043b\u043b\u0430 \u0438 \u043b\u0435\u043e\u043f\u0430\u0440\u0434\u0438\u043a	27s
G	\u0420\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u0447\u0438\u043a \u0437\u0430\u0434\u0430\u0447 \u0438\u0437 \u0421\u0431\u0435\u0440\u0430	30s
H	\u041f\u0430\u0437\u043b	24s
I	Musaigen no Phantom World	23s
J	\u0425\u0430\u0440\u0443\u0445\u0438 \u0438 \u043f\u0443\u0442\u0435\u0448\u0435\u0441\u0442\u0432\u0438\u0435 \u043d\u0430 \u043a\u0440\u0443\u0433\u0435	27s
K	\u041f\u0440\u0438\u043a\u043b\u044e\u0447\u0435\u043d\u0438\u044f \u0433\u0443\u043c\u0430\u043d\u043e\u0438\u0434\u0430 3	27s

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490K - Приключения гуманоида 3

I can’t write a correct editorial without the actual problem statement. Right now the “Problem Statement / Input / Output” sections are empty, so there’s no way to reconstruct the task, constraints, or required solution technique.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490J - Харухи и путешествие на круге

The problem statement is missing from your prompt, so I don’t have enough information to write a correct Codeforces-style editorial.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490I - Musaigen no Phantom World

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 105490I - Musaigen no Phantom World” alone isn’t enough to reconstruct the task reliably, and guessing would lead to a completely wrong solution write-up.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490H - Пазл

The problem statement for Codeforces 105490H - “Пазл” is missing from your message, so there’s no way to reconstruct the intended task, constraints, or required solution strategy.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490G - Разработчик задач из Сбера

The problem statement for “Codeforces 105490G - Разработчик задач из Сбера” is not included in your message, so there is no way to reconstruct the task, constraints, or required algorithm correctly.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490F - Горилла и леопардик

The problem statement is not included in your prompt, so I don’t have the actual task description, constraints, or input/output behavior for 105490F - Горилла и леопардик.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490E - Считаем звезды

The problem statement is missing, so there is no way to reconstruct a correct editorial yet. Codeforces solutions are extremely sensitive to the exact definition of the input, what “stars” means in this context, and what is being counted or optimized.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490C - Мадока и порванный фотоальбом

The photo album is a grid with n rows and m columns, where each cell contains either a forbidden picture or a normal picture.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490D - Очередная сортировка перестановки

The problem statement for “Codeforces 105490D - Очередная сортировка перестановки” is missing from your message, so there is no way to reconstruct the intended solution reliably.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490B - LCA-сумма

We are given a rooted tree for each test case. Every node has exactly one parent except the root, and the parent pointers define the entire structure. From this tree we consider all non-empty subsets of nodes.

Practice › Codeforces Solutions › Когнитивные технологии. Финал 2024 ›

CF 105490A - Логотип VK

I can’t reliably write a correct editorial for this without the actual problem statement. Codeforces IDs alone aren’t enough here because “105490A - Логотип VK” doesn’t uniquely specify the task details (and guessing would risk producing a completely wrong…