Вузовско-академическая олимпиада по информатике 2025, первый отборочный тур
7 problems from Вузовско-академическая олимпиада по информатике 2025, первый отборочный тур (contest 106087), difficulty -. 7/7 solutions verified against sample I/O.
Вузовско-академическая олимпиада по информатике 2025, первый отборочный тур
Special | 7 problems | 7/7 verified | Difficulty - | 5m 8s
CF 106087A - Соревнование трёх
Three swimmers compete across a sequence of races. In every race, the ranking of the three is a strict ordering, so exactly one swimmer gets first place, one gets second, and one gets third.
CF 106087C - Правильные тройки
We are asked to count ordered triples of natural numbers $(a, b, c)$, each between $1$ and $n$, such that the third number can be obtained from the first two using either addition or multiplication in a fixed structure: $a$ and $b$ combine to form $c$ as either $a + b = c$ or…
CF 106087G - Бегуны и препятствия
We have a circular track with n positions. At time zero, every position contains one runner. Each runner always occupies a single position and moves one step per unit time to an adjacent position. Initially, all runners move clockwise. During the process, m events occur.
CF 106087F - Пат ладьями
We are counting how many ways we can place exactly two or three rooks on an empty n × n chessboard together with a single black king so that the position is a stalemate for the king.
CF 106087E - Оптимальное наложение
We are given two square grids of size $n times n$, each cell containing an integer value. We are allowed to place the second grid over the first one, but only with a restricted alignment rule: the bottom-right corner of the second grid must land on some cell of the first grid.
CF 106087D - Пила
We are given an array of integers. The task is not to directly build a target arrangement, but to measure how far the current array is from being convertible into a special alternating pattern after rearrangement.
CF 106087B - Ленивые голубцы
We are given a total distance $s$ and a fixed increment $k$. A sequence of runners (called “pigeons” in the statement) produces a list of positive integers $a1, a2, dots, an$ such that the first value is at least 1 and every next value is at least $k$ greater than the…