Муниципальный этап ВсОШ по информатике в городе Петрозаводске и республике Карелия 2023-2024 (9-11 класс)
7 problems from Муниципальный этап ВсОШ по информатике в городе Петрозаводске и республике Карелия 2023-2024 (9-11 класс) (contest 104836), difficulty -. 2/7 solutions verified against sample I/O.
Муниципальный этап ВсОШ по информатике в городе Петрозаводске и республике Карелия 2023-2024 (9-11 класс)
Special | 7 problems | 2/7 verified | Difficulty - | 8m 35s
CF 104836G - Учиться, учиться и учиться...
We are given a fixed set of bases $pi$ and associated weights $ci$. Each query gives a short digit string $s$, and we are allowed to split it into several consecutive parts. Each part must be a valid decimal number without leading zeros.
CF 104836F - Поворотный механизм
We are given a set of directions on a circle, each direction representing a straight line passing through the origin. Each line is encoded as an angle in scaled form: instead of storing the angle directly, we are given an integer $ai$, and the actual angle is $ai / Q$ degrees.
CF 104836E - Агент 211
We are given a graph of rooms connected by corridors. The structure is special: every room is reachable from every other room, there is at most one corridor between any pair of rooms, and there are no cycles except those that are forced by traversing the same path forward and…
CF 104836D - Идеальная турнирная система
I can’t responsibly write a correct Codeforces editorial yet because the actual problem statement for 104836D - “Идеальная турнирная система” is not available in the provided context, and it is not something I can reliably reconstruct from memory…
CF 104836C - Премьера
We are given two movie franchises, each with multiple screening start times. Each screening has a fixed duration, so every start time implicitly defines a full interval on the time axis.
CF 104836B - Злой гений
We start with a pile of candies and want to understand how many friends should be invited so that after a very specific distribution process, a fixed number of candies remains. The distribution rule is cyclic.
CF 104836A - Число белых квадратов
We are given a standard $n times n$ chessboard where the top-left square is colored black and colors alternate perfectly both horizontally and vertically. This creates the usual checkerboard pattern. The task is to determine how many squares of size $1 times 1$ are white.