VII Липецкая командная олимпиада школьников по программированию. Финал. 8-11 классы
12 problems from VII Липецкая командная олимпиада школьников по программированию. Финал. 8-11 классы (contest 103719), difficulty -. 9/12 solutions verified against sample I/O.
VII Липецкая командная олимпиада школьников по программированию. Финал. 8-11 классы
Special | 12 problems | 9/12 verified | Difficulty - | 9m 8s
CF 103719K - Фатальная ошибка
We are given a sequence of convex polygons, each representing a stain on a sheet of paper. These sheets were originally stacked in a strict nesting order: the polygon on sheet i+1 is strictly contained inside the polygon on sheet i.
CF 103719L - AvtoBus
We are told the total number of wheels in a bus fleet. Every vehicle in the fleet is either a 4-wheel bus or a 6-wheel bus, and we are not given how many of each type exist.
CF 103719I - Formalism for Formalism
I cannot reliably reconstruct Codeforces 103719I - Formalism for Formalism from available context, because the statement is not accessible in the prompt and the problem name corresponds to a gym problem where multiple unrelated tasks appear under similar metadata.
CF 103719J - Rooks Defenders
I don’t have the actual statement for “Codeforces 103719J - Rooks Defenders” in your message, so I can’t reconstruct the intended model, constraints, or solution without risking hallucinating the problem.
CF 103719H - Счастливый порядок
We are asked to generate an infinite ordered list of special integers and pick the n-th one. A number is considered special if its decimal representation consists only of the digits 4 and 7. These numbers form an infinite set like 4, 7, 44, 47, 74, 77, 444, and so on.
CF 103719G - Спасение Минотавра
We are given an $n times m$ grid where each cell will eventually be marked either as a wall or left empty. Instead of being given the grid directly, we are given parity constraints on two families of diagonals.
CF 103719F - Маткульт-привет!
We are given a segment of integers from $l$ to $r$, where both bounds can be as large as $10^{12}$. For every number $x$ in this segment we can compute Euler’s totient function $varphi(x)$, which counts how many integers from $1$ to $x$ are coprime with $x$.
CF 103719D - Toss a Coin to Your Graph...
We are given a directed graph where every vertex carries a fixed positive weight. We begin by placing a coin on any vertex of our choice. Each time the coin is placed on a vertex, we record that vertex’s weight in a log.
CF 103719B - Шахматы и пути
We are given a very large rectangular chessboard where each cell is either white or black in the standard checkerboard pattern determined by coordinate parity.
CF 103719E - Typical Party in Dorm
I’m missing the actual problem statement for Codeforces 103719E - Typical Party in Dorm (the “Input / Output / Description” parts are empty in your message).
CF 103719C - Меховые подпоследовательности
We are given an array of length n, and we look at subsequences defined by choosing any increasing sequence of indices. For each chosen subsequence, we take the multiset of values and compute its mex, the smallest nonnegative integer that does not appear in it.
CF 103719A - Stone Age Problem
We are maintaining a long row of stones, each stone holding a numeric value. Initially, every position starts from a fixed baseline, typically zero. After that, a sequence of operations is applied.