III Олимпиада классов при механико-математическом факультете МГУ имени М.В.Ломоносова по программированию 2024
8 problems from III Олимпиада классов при механико-математическом факультете МГУ имени М.В.Ломоносова по программированию 2024 (contest 105136), difficulty -.
III Олимпиада классов при механико-математическом факультете МГУ имени М.В.Ломоносова по программированию 2024
Special | 8 problems | 7/8 verified | Difficulty - | 7m 25s
CF 105136C - III Олимпиада классов при механико-математическом факультете МГУ
The statement you provided is effectively empty beyond the contest header, so there is no information about the task itself (no input format, no required output, no constraints, and no problem definition).
CF 105136F - Гражданская кампания
We are given a collection of water reservoirs. Each reservoir has a fixed capacity and a current amount of water stored inside it. The operation allowed is very specific: we may choose at most two reservoirs, say i and j, and pour all water from j into i.
CF 105136B - Учись на 54!
We are given a string made only of digits 2, 3, 4, and 5, which represents a sequence of grades in a school journal. We are allowed to modify any character, but only by increasing its value, never decreasing it.
CF 105136H - А о чём задача-то?
We are given a directed structure where each story points to exactly one other story. Formally, each index i has a single outgoing edge to a[i]. We also have a binary array b, where b[i] = 1 means Bunga believes story i was told, and b[i] = 0 means he believes it was not told.
CF 105136G - Разноцветные футболки
We are simulating a process where shirts arrive one by one from the top of a stack and are placed onto a linear hanger with positions from 1 to n.
CF 105136E - Ребята, давайте жить дружно
We are given a multiset of $2n-1$ positive integer weights, representing cheese pieces. We are allowed to choose exactly one of these pieces and cut it into two positive real parts. After this operation, we have exactly $2n$ pieces in total.
CF 105136D - Загадка графа Сандвического.
We are given a vertical stack of circular bread slices, all centered on the same vertical line. Each slice is a cylinder of height 1 and radius r[i]. The first slice touches the table, the second sits on top of the first, and so on.
CF 105136A - Игра как средство интервенции
We are placing rooks on an $n times n$ chessboard, but unlike the classical rook-placement problem, we are allowed to tolerate conflicts. A rook attacks along its row and column, so two rooks in the same row or column attack each other.