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

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

6 items

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

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

# Problem Rating Tags Accepted Time ✓
A \u041c\u0430\u0433\u043d\u0438\u0442 VK 42s ✓
B \u0420\u043e\u0431\u0438\u043d \u0413\u0443\u0434 \u0438 \u043c\u0430\u0441\u0441\u0438\u0432 2m 1s
C \u0410\u0440\u043c\u0430\u0433\u0435\u0434\u0434\u043e\u043d 35s ✓
D \u041e\u0445\u043e\u0442\u0430 \u043d\u0430 \u043c\u043e\u043d\u0441\u0442\u0440\u0430 24s
E \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0435\u0435 \u043e\u0431\u0449\u0435\u0435 \u043f\u0440\u043e\u0441\u0442\u043e\u0435 24s
F \u0420\u0430\u0441\u0441\u0442\u043e\u044f\u043d\u0438\u0435 \u043c\u0435\u0436\u0434\u0443 \u0442\u043e\u0447\u043a\u0430\u043c\u0438 27s ✓
Practice › Codeforces Solutions › Когнитивные технологии 2023-2024. Первый отбор ›

CF 106458B - Робин Гуд и массив

Sure. Please provide the Codeforces problem statement (or a link/name + constraints), and I’ll write a detailed competitive programming editorial covering: - Problem restatement / intuition - Key observations - Derivation of the algorithm - Proof of correctness - Complexity…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Когнитивные технологии 2023-2024. Первый отбор ›

CF 106458F - Расстояние между точками

The task is to compute the straight-line distance between two points on a coordinate plane. The input describes the coordinates of two points, each represented by its x-coordinate and y-coordinate. The output is the length of the segment connecting these two points.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Когнитивные технологии 2023-2024. Первый отбор ›

CF 106458E - Наибольшее общее простое

I cannot reliably reconstruct Codeforces problem 106458E - “Наибольшее общее простое” from available public context, and the title alone is ambiguous enough that multiple different problems could match it (for example “largest common prime divisor”…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Когнитивные технологии 2023-2024. Первый отбор ›

CF 106458D - Охота на монстра

I can write the full editorial, but I do not have enough information to determine the actual problem for Codeforces 106458D - “Охота на монстра”.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Когнитивные технологии 2023-2024. Первый отбор ›

CF 106458A - Магнит VK

We are given an $n times m$ grid where each cell is colored either black or white. We are allowed to place two kinds of objects on grid cells: “south” magnets that remain fixed forever, and “north” magnets that can move over time.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Когнитивные технологии 2023-2024. Первый отбор ›

CF 106458C - Армагеддон

A baker has a limited amount of dough and several kinds of stuffing. A bun without stuffing consumes only dough and gives a fixed amount of money.
codeforces competitive-programming Jun 25, 2026