Олимпиада имени И.М. Дризе по информатике (программированию). Город Ижевск, 2024 год
5 problems from Олимпиада имени И.М. Дризе по информатике (программированию). Город Ижевск, 2024 год (contest 105236), difficulty -. 2/5 solutions verified against sample I/O.
Олимпиада имени И.М. Дризе по информатике (программированию). Город Ижевск, 2024 год
Special | 5 problems | 2/5 verified | Difficulty - | 7m 49s
CF 105236A - Самое короткое условие
We are given three integers $R$, $x$, and $y$. We consider all integer segments $[l, r]$ such that both endpoints lie between 1 and $R$. For each such segment, we look at how many numbers inside it are divisible by $y$.
CF 105236B - Найди отрицательное
We are given two points on the integer grid, each acting as the center of a circular influence. Around each center, every lattice point within a given Euclidean radius has its value flipped by multiplying it by −1.
CF 105236E - Гробовая геометрия
We are given a set of points on a 2D integer grid. Among them, there exists a hidden point $(a, b)$. For every given point $(xi, yi)$, we are also given the squared Euclidean distance from that point to $(a, b)$, but the list of these distances is shuffled, so we do not know…
CF 105236D - Посчитай-ка пути
We are given a weighted tree with up to one hundred thousand vertices. Each edge has an integer weight. For every query, we pick two vertices and look at the unique simple path between them. This path gives us a sequence of edge weights in order.
CF 105236C - Футбол в Берляндии
We have $n$ football players. Initially, each player $i$ has a shirt numbered $i$, so the labels form the sequence $1,2,dots,n$. After a change, shirt number $1$ is replaced by $n+1$, so the available set of shirt numbers becomes $2,3,dots,n+1$.