Индивидуальная олимпиада школьников по информатике и программированию 2024
5 problems from Индивидуальная олимпиада школьников по информатике и программированию 2024 (contest 105058), difficulty -. 0/5 solutions verified against sample I/O.
Индивидуальная олимпиада школьников по информатике и программированию 2024
Special | 5 problems | 0/5 verified | Difficulty - | 8m
CF 105058A - Степенные числа
We are given many independent queries. Each query provides two integers, a starting value n and a base k. We want to find the smallest integer x such that x ≥ n and x can be written as a sum of distinct powers of k. This means we are allowed to pick exponents a1, a2, ...
CF 105058C - Нечестная игра
We are given an $n times m$ grid with a single token (the “piece”) starting at cell $(r, c)$. The game evolves in discrete rounds.
CF 105058E - Годовой отчет
We are given several independent scenarios. In each scenario, there are up to 40 candidates, each carrying a label that encodes their knowledge about a fixed number of topics as a bitmask.
CF 105058D - Стековое кодирование
We are given a static array and for each query we must output a sequence of stack operations that reproduces exactly the subarray defined by the query, using a very specific encoding model. The model is a stack that supports three actions.
CF 105058B - Mixing Drinks
We are given a cup made of multiple horizontal layers of coffee. Each layer has a fixed volume (height) and a fixed “strength”. The layers are stacked from bottom to top, and initially nothing is mixed.