Когнитивные технологии 2024-2025. Третий отбор

6 problems from Когнитивные технологии 2024-2025. Третий отбор (contest 105618), difficulty -. 4/6 solutions verified against sample I/O.

6 items

Когнитивные технологии 2024-2025. Третий отбор

Special | 6 problems | 4/6 verified | Difficulty - | 4m 33s

#	Problem	Time	✓
A	1000-7x	42s	✓
B	\u041f\u043e\u0431\u0435\u0434\u0438\u0442\u0435\u043b\u0438 \u043e\u043b\u0438\u043c\u043f\u0438\u0430\u0434\u044b	37s
C	\u0421\u043f\u043b\u043e\u0447\u0435\u043d\u043d\u043e\u0441\u0442\u044c \u0432 IT	1m 2s	✓
D	\u041f\u043b\u043e\u0445\u043e\u0439 \u0421\u0430\u043d\u0442\u0430	45s	✓
E	\u0421\u043e\u043d\u0430\u0442\u0430 \u0415\u0432\u043a\u043b\u0438\u0434\u0430	19s
F	\u041a\u0442\u043e \u0445\u043e\u0447\u0435\u0442 \u0441\u0442\u0430\u0442\u044c \u043d\u0435\u043c\u0430\u043b\u043e\u043d\u044c\u0435\u0440\u043e\u043c?	1m 8s	✓

Practice › Codeforces Solutions › Когнитивные технологии 2024-2025. Третий отбор ›

CF 105618F - Кто хочет стать немалоньером?

We are given a weighted undirected graph with $n$ rooms and $m$ bidirectional tunnels. Each tunnel has a travel cost. We always start from room $1$, and for every room $v$ we want the minimum cost to reach it.

Practice › Codeforces Solutions › Когнитивные технологии 2024-2025. Третий отбор ›

CF 105618D - Плохой Санта

The input describes a Secret Santa assignment as a permutation. Child i currently gives a present to child p[i]. Some children are marked as bad, and after the announcement the assignment has to be repaired.

Practice › Codeforces Solutions › Когнитивные технологии 2024-2025. Третий отбор ›

CF 105618C - Сплоченность в IT

We are given a line of employees, each represented by a lowercase letter from a to z. The string describes them in left-to-right order. Two adjacent employees are considered compatible for interaction if their letters are consecutive in the alphabet.

Practice › Codeforces Solutions › Когнитивные технологии 2024-2025. Третий отбор ›

CF 105618E - Соната Евклида

I can’t reliably write a correct editorial for this yet because the actual problem statement is missing from your message. Right now I only see the title “Codeforces 105618E - Соната Евклида”, but no description of the input, output, or task.

Practice › Codeforces Solutions › Когнитивные технологии 2024-2025. Третий отбор ›

CF 105618A - 1000-7x

We are given two collections of equal size, each containing short strings representing T-shirt sizes. The strings are unordered, so what matters is not the position of each size but how many times each distinct size appears.

Practice › Codeforces Solutions › Когнитивные технологии 2024-2025. Третий отбор ›

CF 105618B - Победители олимпиады

I can write the full editorial, but I’m missing the actual problem statement for Codeforces 105618B. The title alone, “Победители олимпиады”, is not enough to determine the required algorithm, input format, constraints, edge cases, or the correct Python…