2025-2026 Финал региональной олимпиады Машина Тьюринга

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

6 items

2025-2026 Финал региональной олимпиады Машина Тьюринга

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

#	Problem	Time	✓
A	\u0421\u0442\u0440\u0430\u043d\u043d\u0430\u044f \u0444\u0438\u0433\u0443\u0440\u0430	44s	✓
B	\u0422\u0440\u0435\u0443\u0433\u043e\u043b\u044c\u043d\u0438\u043a \u041c\u0430\u0440\u0441\u0435\u043b\u044f	41s	✓
C	\u0425\u0440\u0430\u043d\u0438\u0442\u0435\u043b\u044c \u0421\u043d\u043e\u0432	1m	✓
D	\u0417\u0430\u0440\u044f\u0434\u043a\u0430	1m 21s	✓
E	\u0420\u0430\u043c\u0430\u0437\u0430\u043d \u0438 \u0448\u0442\u0430\u043d\u0433\u0430 70\u043a\u0433	1m 1s	✓
F	\u0427\u0435\u0440\u043d\u043e-\u0431\u0435\u043b\u043e\u0435 \u0434\u0435\u0440\u0435\u0432\u043e	1m 19s	✓

Practice › Codeforces Solutions › 2025-2026 Финал региональной олимпиады Машина Тьюринга ›

CF 106435E - Рамазан и штанга 70кг

We are given a fixed sequence of days, where each day is either a training day or a rest day. We need to imagine a process that starts with a weight of 0 kilograms and evolves day by day according to the same rules every time we start from a chosen day.

Practice › Codeforces Solutions › 2025-2026 Финал региональной олимпиады Машина Тьюринга ›

CF 106435B - Треугольник Марселя

We are given a triangular table of numbers built row by row. The top cell and both outer borders are fixed to zero. Every other cell is defined by taking the two cells directly above it (above-left and above-right) and computing the MEX of their values.

Practice › Codeforces Solutions › 2025-2026 Финал региональной олимпиады Машина Тьюринга ›

CF 106435A - Странная фигура

We are given a construction that starts with a square and then repeatedly places additional squares inside it. Each new square is rotated by 45 degrees relative to the previous one, so the whole picture becomes a nested system of overlapping diagonals and edges rather than a…

Practice › Codeforces Solutions › 2025-2026 Финал региональной олимпиады Машина Тьюринга ›

CF 106435D - Зарядка

We have a row of rooms indexed from left to right. A special position k plays a central role. On certain days, a “director event” happens, and each such event triggers a time-dependent pattern of which rooms participate in morning exercise.

Practice › Codeforces Solutions › 2025-2026 Финал региональной олимпиады Машина Тьюринга ›

CF 106435F - Черно-белое дерево

We are given a rooted tree with root at node 1. Each vertex can be painted either white or black, and we must paint exactly $k$ vertices black. All other vertices remain white.

Practice › Codeforces Solutions › 2025-2026 Финал региональной олимпиады Машина Тьюринга ›

CF 106435C - Хранитель Снов

We are given a sleeping interval from time a to time b. Inside this interval there are n fixed moments when nightmares occur, each one causing Vladimir to briefly wake up. These moments are strictly increasing. We are allowed to remove at most k of these nightmare moments.