Муниципальный этап ВОШ по информатике в Петрозаводске и Карелии 2022-2023
6 problems from Муниципальный этап ВОШ по информатике в Петрозаводске и Карелии 2022-2023 (contest 104091), difficulty -. 6/6 solutions verified against sample I/O.
Муниципальный этап ВОШ по информатике в Петрозаводске и Карелии 2022-2023
Special | 6 problems | 6/6 verified | Difficulty - | 4m 41s
CF 104091F - Будь начеку! 2
We are counting how many valid numbers of length n can be formed under a very specific adjacency rule. A number is considered valid if every pair of consecutive digits forms a two-digit number that is prime.
CF 104091E - Шахтёрское ремесло
We are simulating a simplified 2D world that behaves like a long 1D strip of width n and unlimited vertical height. Initially, every position in this strip is covered with grass. During the process, the game engine spawns horizontal segments of earth blocks.
CF 104091D - Шахматный дозор
We are given a rectangular grid with $n$ rows and $m$ columns. Inside this grid there are $q$ special pieces called scouts. Each scout sits on a distinct cell $(x, y)$, where $x$ is the row index from top to bottom and $y$ is the column index from left to right.
CF 104091B - Вступительное испытание в Коллегию Винтерхолда
We are given a positional numeral system with base $b$. Every integer has a representation in that base, and we are interested in the number of trailing zeros in that representation.
CF 104091A - Градостроитель
We are given a total amount of unit area S, and we want to partition this area into several disjoint square plots.
CF 104091C - Будь начеку!
We need to count how many decimal numbers with exactly n digits satisfy a special adjacency rule. A number is called beautiful if every pair of neighboring digits forms a two digit number divisible by 3.