2025-2026 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 25, Саратовский отборочный этап)
12 problems from 2025-2026 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 25, Саратовский…
2025-2026 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 25, Саратовский отборочный этап)
Special | 12 problems | 12/12 verified | Difficulty - | 11m 36s
CF 106142D - Нужное количество единиц
We are asked to process multiple independent queries. Each query gives an interval $[a, b]$ and a target number $k$. For every integer $x$ in that interval, we convert $x$ into binary without leading zeros and count how many bits are equal to 1.
CF 106142J - Размещение постройки
We are given a very large rectangular grid with n rows and m columns. Some cells are blocked by stones, and all remaining cells are free.
CF 106142F - Сделать максимальным
We are given an array of integers, and for every position we must answer a separate optimization question about that position’s value. The element at index i is treated as a fixed reference element.
CF 106142H - Разделение на части
We are given a string composed of lowercase Latin letters. The task is to cut this string into several contiguous segments so that every character belongs to exactly one segment. Each segment must satisfy a strict structural constraint.
CF 106142C - Построение порталов
We are given a directed graph where edges describe one-way movement between cities. In addition to traveling along these edges, we are allowed to place special “portals” in selected vertices.
CF 106142K - Цикл робота
We are given a grid of free and blocked cells, and we need to count how many distinct closed robot routes exist. The robot always starts on a free cell, moves to any of the 8 neighboring cells (including diagonals), and forms a cycle that returns to the starting cell.
CF 106142L - Третья сторона
We are given two fixed side lengths of a triangle, $a$ and $b$, and we want to understand what integer values a third side $c$ can take so that the three segments form a valid triangle with positive area.
CF 106142G - Количество раскрасок
We are working with a line of $n$ cells. Starting from an empty state, we perform $n-1$ painting operations. In operation $i$, we choose any contiguous segment of the line and repaint all cells in that segment with color $i$, overwriting anything previously painted.
CF 106142I - Светофор
We are observing a traffic light that cycles through four phases in a fixed order. The light starts at red, then switches to yellow, then green, then yellow again, and finally returns to red, repeating this cycle forever.
CF 106142E - Массив Монокарпа
We are given an array of integers and a threshold value $d$. After we optionally delete exactly one contiguous segment from the array, the remaining elements must form a sequence whose maximum value minus minimum value is at most $d$.
CF 106142B - Создание перестановки
We are given a hidden permutation of length $n$. Only two special elements matter: the position where the smallest value $1$ sits, and the position where the largest value $n$ sits.
CF 106142A - Выкладывание карточек
We are given all integers from 1 to n, each written on exactly one card, and these cards are arranged into a single sequence using a fixed construction rule.