XVIII Нижегородская городская олимпиада школьников по информатике им. В. Д. Лелюха
7 problems from XVIII Нижегородская городская олимпиада школьников по информатике им. В. Д. Лелюха (contest 105150), difficulty -. 1/7 solutions verified against sample I/O.
XVIII Нижегородская городская олимпиада школьников по информатике им. В. Д. Лелюха
Special | 7 problems | 1/7 verified | Difficulty - | 10m 12s
CF 105150G - Объединение камней
We are given two collections of stones, one stored in an inventory and the other in a chest. Each stone has a size, and for every size we know how many stones of that size exist in each location.
CF 105150F - Максим и пит-стоп
We are simulating a race where the cost of each lap depends on how worn the current tire set is. Each tire set starts with some initial wear value, and every time a lap is driven on that set, the lap takes exactly the current wear value in seconds, and then the wear increases…
CF 105150E - Занавески
We are given a square office, but only its left and bottom walls exist. The top and right sides are open and act like a continuous source of incoming light.
CF 105150D - Хронометраж и программирование
We are asked to imagine an infinite increasing sequence built from numbers that can be written in the form $$x = 2^k + 60m$$ where $k$ and $m$ are positive integers (or at least positive for $k$, and non-negative for $m$, depending on interpretation; the important part is that…
CF 105150C - Карта кобры
We are given a line of segments, each segment indexed from 1 to n. The interesting part is that each segment i has a constraint value a[i] which controls how restrictive the next move becomes after visiting i.
CF 105150A - Умный светофор
We are given a traffic light that alternates which of two one-way streets is allowed to pass. The pattern of the light is periodic and fully known in advance. Every minute belongs to either street 1 or street 2 depending on this repeating pattern. A set of cars arrives over time.
CF 105150B - Налоги
We are given two independent progressive tax systems and a fixed total income $X$. Dmitry and Anna must split this income into two parts: Dmitry declares $t$, and Anna declares $X - t$.