2023-2024 Финал региональной олимпиады «Машина Тьюринга»

6 problems from 2023-2024 Финал региональной олимпиады «Машина Тьюринга» (contest 105051), difficulty -. 6/6 solutions verified against sample I/O.

6 items

2023-2024 Финал региональной олимпиады «Машина Тьюринга»

Special | 6 problems | 6/6 verified | Difficulty - | 5m 32s

# Problem Rating Tags Accepted Time ✓
A \u0412\u044b\u0431\u043e\u0440\u044b \u0432 \u0420\u0418\u041b\u0418 47s ✓
B \u041c\u0430\u0433\u0438\u0447\u0435\u0441\u043a\u0438\u0439 \u043a\u0432\u0430\u0434\u0440\u0430\u0442 48s ✓
C \u041d\u0435\u043e\u0431\u044b\u0447\u043d\u0430\u044f \u0448\u0430\u0445\u043c\u0430\u0442\u043d\u0430\u044f \u0434\u043e\u0441\u043a\u0430 57s ✓
D \u041f\u0438\u0440\u0430\u043c\u0438\u0434\u0430 58s ✓
E \u0421\u043b\u043e\u0436\u043d\u0430\u044f \u0438\u0433\u0440\u0430 58s ✓
F \u0418\u0441\u043a\u0443\u0441\u0441\u0442\u0432\u0435\u043d\u043d\u044b\u0439 \u0438\u043d\u0442\u0435\u043b\u043b\u0435\u043a\u0442 1m 4s ✓
Practice › Codeforces Solutions › 2023-2024 Финал региональной олимпиады «Машина Тьюринга» ›

CF 105051F - Искусственный интеллект

We are given a collection of strings built from a small alphabet of size at most 20. For each query string, we need to choose one string from the collection that is compatible with it in a very specific sense: the chosen string must not share any character with the query string.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 Финал региональной олимпиады «Машина Тьюринга» ›

CF 105051D - Пирамида

Each input brick is a rectangle with fixed dimensions $wi times hi$. From any brick, you are allowed to “shrink” it into exactly one new rectangle $a times b$, as long as both sides do not increase, meaning $a le wi$ and $b le hi$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 Финал региональной олимпиады «Машина Тьюринга» ›

CF 105051E - Сложная игра

We are given a grid of size $n times m$, where each cell contains either a 0 or a 1. A 1 represents a cell with a candy, and a 0 means it is empty. A player starts at the top-left cell and can only move either one step right or one step down at each move.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 Финал региональной олимпиады «Машина Тьюринга» ›

CF 105051C - Необычная шахматная доска

We are given a rectangular grid with n rows and m columns. Every cell is assigned one of three colors, but the coloring is not based on parity like a standard chessboard.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 Финал региональной олимпиады «Машина Тьюринга» ›

CF 105051B - Магический квадрат

We are given a partially filled 3×3 grid that is known to be a magic square. That means the grid contains the numbers from 1 to 9 exactly once, and every row, every column, and both diagonals sum to the same value.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023-2024 Финал региональной олимпиады «Машина Тьюринга» ›

CF 105051A - Выборы в РИЛИ

Three candidates are receiving votes in an election. The first candidate currently has a votes, the second has b, and the third has c. More votes may still arrive, but only additional votes for the first candidate matter.
codeforces competitive-programming Jun 28, 2026