Муниципальный этап ВсОШ по информатике (программирование) 10-11 класс, Свердловская область, 2025
5 problems from Муниципальный этап ВсОШ по информатике (программирование) 10-11 класс, Свердловская область, 2025 (contest 106284), difficulty -. 5/5 solutions verified against sample I/O.
Муниципальный этап ВсОШ по информатике (программирование) 10-11 класс, Свердловская область, 2025
Special | 5 problems | 5/5 verified | Difficulty - | 3m 24s
CF 106284D - НОД-свёртка
We need count triples of non-negative integers (A, B, C) inside three given intervals such that the greatest common divisor of the two sums around B equals the sum of the two outer values: gcd(A + B, B + C) = A + C.
CF 106284E - Игра Кроша
The game contains a line of carrot monsters. Krosh can only directly attack the first monster that is still alive. To reach a later monster, every monster before it must already be defeated. A shot aimed at the current monster deals increasing damage to a consecutive block.
CF 106284C - Турнир Смешариков
We are given a complete round-robin tournament between $N$ players, where every pair of players plays exactly one match. Since there are $frac{N(N-1)}{2}$ matches in total, we need to output an ordering of all pairs.
CF 106284A - Симфония будильников
The problem describes three alarm clocks that all start ringing at the same moment, time 0. The first clock rings every a minutes, the second every b minutes, and the third every c minutes.
CF 106284B - Кто больше?
We have several unsigned integer types. A type with a bits can store values from 0 to 2^a - 1. We need decide whether there exists some integer x that fits into a smaller type, but its square does not fit into a larger type.