Отборочный этап региональной олимпиады «Машина Тьюринга» по программированию
9 problems from Отборочный этап региональной олимпиады «Машина Тьюринга» по программированию (contest 105025), difficulty -. 9/9 solutions verified against sample I/O.
Отборочный этап региональной олимпиады «Машина Тьюринга» по программированию
Special | 9 problems | 9/9 verified | Difficulty - | 8m 4s
CF 105025I - Два друга
Two players build a single tower by alternately placing blocks on top. Each block has an integer weight between $l$ and $r$, and both players can reuse any weights as often as they want. The tower starts with total weight $0$.
CF 105025G - Зачет по информатике
We are given a line of positions numbered from 1 to m, and a collection of weighted segments. Each segment covers a contiguous interval of these positions and has a cost if we choose to use it.
CF 105025H - Шихан
We are working with a hidden “mountain” defined over a very large grid of size $n times m$. Somewhere on this grid there is a single special cell $(x0, y0)$, the peak.
CF 105025E - Банановый бизнес Олега
We are given a sequence of banana prices arranged in a line. Each position holds one value, and we are allowed to perform exactly $k$ operations, where one operation swaps two adjacent elements.
CF 105025D - Недовольство Марселя
We are given two ordered groups of cars positioned along a straight road at a fixed moment in time. One group moves away from the origin, the other moves toward it, all at identical speed.
CF 105025F - Рэп игра
We are given a collection of text lines, and we are allowed to rearrange them in any order. The score of an arrangement is determined only by adjacent pairs: for every neighboring pair of strings, we compute how long their suffixes match character by character from the end…
CF 105025C - Солнечная панель
We are given a sequence of heights representing consecutive segments of a roof. Each segment has a fixed height, and we want to place a solar panel on a contiguous interval of these segments.
CF 105025A - Цифры помогают мыслить
We are given an integer a, which can be negative, zero, or positive. We are allowed to add a non-negative integer x to it. The goal is to make the resulting number a + x look like a valid time displayed on a digital clock.
CF 105025B - Две монеты
We are given two positive integers $k$ and $n$. They describe a hidden pair of coin values $A$ and $B$ under two constraints at the same time. First, one coin value is a multiplicative scaling of the other: $A = k cdot B$.