Муниципальный этап ВсОШ по информатике, 9-11 классы, Нижегородская область, 2024
5 problems from Муниципальный этап ВсОШ по информатике, 9-11 классы, Нижегородская область, 2024 (contest 105592), difficulty -. 5/5 solutions verified against sample I/O.
Муниципальный этап ВсОШ по информатике, 9-11 классы, Нижегородская область, 2024
Special | 5 problems | 5/5 verified | Difficulty - | 4m 15s
CF 105592D - Шоколадка
We start with a rectangular chocolate bar of size $n times m$. The final goal is to end up with a square chocolate, but the allowed operation is not free-form cutting.
CF 105592B - Учёные
We are given a collection of objects numbered from 1 up to a very large integer n. Each object has a simple derived label: the sum of digits of its index. Two objects are considered equivalent if their digit sums match. We are not choosing specific indices ourselves.
CF 105592E - Таблица деления
We are given a sequence of integers $a1, a2, dots, an$. From these values we conceptually build an $n times n$ table. The entry at row $i$, column $j$ is defined as the integer part of the division $aj / ai$.
CF 105592C - Скучная строка
We are given a string made of lowercase Latin letters. The string becomes “bad” whenever some character appears in a single contiguous block of length at least m.
CF 105592A - Первое уравнение
We are given a positive integer $n$. We consider ways to split $n$ into two natural numbers, meaning positive integers, written as pairs $(a, b)$ such that $a + b = n$. The same applies to another pair $(c, d)$ with $c + d = n$.