XIX Нижегородская городская олимпиада школьников по информатике им. В. Д. Лелюха
8 problems from XIX Нижегородская городская олимпиада школьников по информатике им. В. Д. Лелюха (contest 105151), difficulty -. 3/8 solutions verified against sample I/O.
XIX Нижегородская городская олимпиада школьников по информатике им. В. Д. Лелюха
Special | 8 problems | 3/8 verified | Difficulty - | 10m 24s
CF 105151H - От 6 до 12?
We are given a single integer $n$, and we want to split it into an ordered pair of positive integers $(a, b)$ such that $a + b = n$.
CF 105151E - Циклические скобки
We are given a circular sequence of typed brackets, where each element is an integer. A positive value represents an opening bracket of a certain type, and the corresponding negative value represents its matching closing bracket.
CF 105151C - Нижний Нижний Нижний Новгород
We are given a graph with stations as vertices and tunnels as undirected edges. Each station has a cost, and we also have a modulus value $k$. For any chosen starting station $s$, we consider all stations that are reachable from $s$ using at most $d$ edges.
CF 105151F - Double D
Two players simulate a deterministic game on a single integer. The state is just one number, initially $n$. Players alternate turns, starting with the first player. On each turn, the active player tries to apply a division move using their own fixed divisor.
CF 105151G - Мой пешечный эндшпиль не удался, как я и ожидал
The board is extremely tall but only two columns wide, so every row is just a left or right cell. A white pawn starts at the bottom-left cell and moves upward row by row until it either gets stuck or reaches the top row at height $10^{18}$.
CF 105151D - Скидки и точки
We are given a set of points on a plane, each representing a shop that yields exactly one collectible item. The key restriction is geometric: we are only allowed to pick items from shops that lie on a single straight line.
CF 105151B - Капельки
We are given a set of rain droplets that each fall onto a point on a horizontal line. Each droplet appears at a specific coordinate and only starts expanding after its own falling time.
CF 105151A - Чкаловская лестница
We are given five integers that describe how many steps exist in different segments of a staircase structure. The picture (which we do not need explicitly) encodes a set of possible routes from the bottom to the top, where each route corresponds to choosing a sequence of…