Municipal stage of ROI in Nizhny Novgorod 2023

6 problems from Municipal stage of ROI in Nizhny Novgorod 2023 (contest 104885), difficulty -. 4/6 solutions verified against sample I/O.

6 items

Municipal stage of ROI in Nizhny Novgorod 2023

Special | 6 problems | 4/6 verified | Difficulty - | 3m 50s

#	Problem	Time	✓
A	\u0414\u0435\u0442\u0430\u043b\u0438 \u0438 \u0440\u0435\u0441\u0443\u0440\u0441\u044b	28s
B	\u041f\u043e\u0441\u0447\u0438\u0442\u0430\u0439	48s	✓
C	\u041e\u0447\u0435\u0440\u0435\u0434\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430 \u043d\u0430 \u043a\u043e\u043d\u0441\u0442\u0440\u0443\u043a\u0442\u0438\u0432	46s	✓
D	\u0412\u0440\u0435\u043c\u044f \u043d\u0430 \u043c\u0430\u0440\u0441\u0435	23s
E	\u0425\u043e\u0440\u043e\u0448\u0438\u0435-\u0445\u043e\u0440\u043e\u0448\u0438\u0435 \u043f\u043e\u0434\u043e\u0442\u0440\u0435\u0437\u043a\u0438	41s	✓
F	\u041e\u0447\u0435\u0440\u0435\u0434\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430 \u043f\u0440\u043e \u0437\u0430\u043f\u0440\u043e\u0441\u044b \u043d\u0430 \u043f\u0435\u0440\u0435\u0441\u0442\u0430\u043d\u043e\u0432\u043a\u0430\u0445	44s	✓

Practice › Codeforces Solutions › Municipal stage of ROI in Nizhny Novgorod 2023 ›

CF 104885F - Очередная задача про запросы на перестановках

We are given a permutation of size $n$ and a set of range queries. Each query is defined by an interval $[l, r]$.

Practice › Codeforces Solutions › Municipal stage of ROI in Nizhny Novgorod 2023 ›

CF 104885E - Хорошие-хорошие подотрезки

We are given an array and we work with its prefix sums. Let pref[i] denote the sum of the first i elements, with pref[0] = 0. A subarray [l, r] is called good when its sum is zero, which is equivalent to pref[r] - pref[l-1] = 0, or pref[r] = pref[l-1].

Practice › Codeforces Solutions › Municipal stage of ROI in Nizhny Novgorod 2023 ›

CF 104885D - Время на марсе

We are given a time interval on a clock, written in hours and minutes, from a starting moment H1:M1 to an ending moment H2:M2.

Practice › Codeforces Solutions › Municipal stage of ROI in Nizhny Novgorod 2023 ›

CF 104885B - Посчитай

The task describes a simple numerical construction based on repeatedly summing powers of an integer $k$. For each query, we are given a base value $k$ and a length $n$, and we must compute the value obtained by adding the first $n$ powers of $k$, starting from $k^1$.

Practice › Codeforces Solutions › Municipal stage of ROI in Nizhny Novgorod 2023 ›

CF 104885C - Очередная задача на конструктив

We are building two sequences of decimal digits under a shared budget constraint. The process constructs both sequences in parallel, and at each step we spend part of a fixed total sum to append digits.

Practice › Codeforces Solutions › Municipal stage of ROI in Nizhny Novgorod 2023 ›

CF 104885A - Детали и ресурсы

We are given a production setup with several workers. Each worker produces a fixed number of identical parts, and every part consumes a fixed amount of metal. All produced metal is then packed into containers, where each container can hold only a limited weight.