2024-2025 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 24, Саратовский отборочный этап)
12 problems from 2024-2025 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 24, Саратовский…
2024-2025 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 24, Саратовский отборочный этап)
Special | 12 problems | 12/12 verified | Difficulty - | 12m 45s
CF 105507D - Преобразование строки
We are given two strings of equal length, both consisting of lowercase Latin letters. The only allowed operation takes the first character of the current string, removes it, and reinserts it anywhere in the string, including back to the front or the end.
CF 105507K - Раскраска матрицы
We are working with an $n times m$ grid that starts completely white. One operation chooses a single cell $(x,y)$ and a color among white, red, or blue, but the effect is not local: the whole row $x$ and the whole column $y$ are repainted in that color, overwriting anything…
CF 105507L - Идеальная фотография
We are given a set of players, each with a distinct height. We want to place all existing players in a single line and possibly add new players so that the final lineup forms a perfectly consecutive sequence of heights.
CF 105507J - Поиск и замена
We are given an array of integers. Each operation modifies this array in a very specific way: we locate two special positions, one containing a maximum value and one containing a minimum value.
CF 105507I - Этажи, этажи...
A high-rise building is described where apartments are numbered continuously starting from 1, beginning on the first floor, and every floor contains the same number of apartments.
CF 105507H - Вычитание
We are given a very large positive integer written in decimal form. From this number we want to subtract another positive integer $b$, chosen by us, under two constraints. First, $b$ must be strictly smaller than the given number.
CF 105507G - Задача про сортировку
We are given a permutation of length $n$, and the task is to transform it into the identity permutation $[1,2,dots,n]$. The only allowed operation is reversing any subarray of length at least two. However, the transformation is constrained in two additional ways.
CF 105507F - Бильярд
We are given a triangular arrangement of balls, where row 1 has 1 ball, row 2 has 2 balls, and so on up to row n. The balls are numbered consecutively row by row from top to bottom, and within each row from left to right.
CF 105507E - Рассадка на экзамене
We are given a single row of seats in an exam hall, represented as a string of length $n$. Each position is either occupied by a student or empty. Our task is to reorganize students by moving some of them from their current seats into empty ones.
CF 105507C - Дерево обхода в глубину
We are given a connected undirected graph $G$ with up to $n$ vertices and $m$ edges, and inside this graph we are also given a spanning tree $T$ on the same set of vertices. Every edge of $T$ is guaranteed to exist in $G$, but $G$ may contain additional edges.
CF 105507B - Голы
We are given several independent seasons of a football team. For each season, we know how many matches were won and lost, and we also know the total number of goals scored and conceded across all matches. No draws exist, so every match is strictly either a win or a loss.
CF 105507A - Покупка велосипеда
We are asked to pay an exact amount using only two coin types, one worth 2 units and the other worth 5 units. The goal is not just to determine whether the sum can be formed, but to construct a combination of coins whose total value is exactly the required amount and uses as…