Отбор в ЦРОД 2022

12 problems from Отбор в ЦРОД 2022 (contest 104687), difficulty -. 11/12 solutions verified against sample I/O.

12 items

Отбор в ЦРОД 2022

Special | 12 problems | 11/12 verified | Difficulty - | 13m

#	Problem	Time	✓
A	\u0422\u0440\u0435\u0443\u0433\u043e\u043b\u044c\u043d\u0438\u043a	57s	✓
B	\u041e\u0442\u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u0430\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432	1m 9s
C	\u0421\u0443\u043c\u043c\u0430 1	1m 1s	✓
D	\u0421\u0443\u043c\u043c\u0430 2	59s	✓
E	\u0421\u0442\u0440\u043e\u043a\u0430-1	55s	✓
F	\u0421\u0442\u0440\u043e\u043a\u0430-2	1m 5s	✓
G	\u041f\u043e\u043a\u0443\u043f\u043a\u0430	1m 17s	✓
H	\u0412\u044b\u0431\u043e\u0440 \u0447\u0438\u0441\u0435\u043b 1	1m 7s	✓
I	\u0412\u044b\u0431\u043e\u0440 \u0447\u0438\u0441\u0435\u043b 2	1m 26s	✓
J	\u0412\u044b\u0431\u043e\u0440 \u0447\u0438\u0441\u0435\u043b 3	1m 6s	✓
K	\u041d\u0430\u0439\u0442\u0438 \u0447\u0438\u0441\u043b\u043e-1	1m	✓
L	\u041d\u0430\u0439\u0442\u0438 \u0447\u0438\u0441\u043b\u043e-2	58s	✓

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

CF 104687C - Сумма 1

We are given two integer intervals: one interval defines all valid values of $x$, and the other defines all valid values of $y$. We also have a target sum $n$.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

We are given a large integer $a$, and we are promised that it has a very special structure: there exist two consecutive integers greater than 1 that both divide $a$. In other words, somewhere there is a pair $(x, x+1)$ with $x 1$ such that both divide $a$.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

CF 104687B - Отсортировать массив

We are given a sequence of integers and are allowed to rearrange it by sorting. After sorting, we compute the total “adjacent difference cost”, which is the sum of absolute differences between every pair of consecutive elements in the sorted sequence.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

CF 104687J - Выбор чисел 3

We are given a sequence of integers indexed from left to right. The task is to pick exactly k positions in this sequence such that any two chosen positions are separated by at least d indices. Among all valid selections, we want the maximum possible sum of the chosen values.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

CF 104687K - Найти число-1

We are given a positive integer $a$. The task is to choose another integer $b$ such that $1 le b < a$, and the expression $$frac{a cdot b}{a + b}$$ is an integer. Equivalently, we need $a cdot b$ to be divisible by $a + b$.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

CF 104687I - Выбор чисел 2

We are given an array of integers and we need to pick exactly three elements from it. The only restriction is structural: if we pick elements at positions $i1 < i2 < i3$, then each consecutive pair must be separated by at least $d$ indices, meaning $i{t+1} - it ge d$.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

CF 104687H - Выбор чисел 1

We are given a sequence of integers indexed from left to right, and we need to choose exactly three positions in this sequence.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

CF 104687G - Покупка

We are given a row of pencils, each with a price, and we must end up buying exactly $k$ of them. The process is sequential: we scan from left to right and decide at each position whether to buy that pencil. The cost of buying a pencil is not just its price.

Practice › Codeforces Solutions › Отбор в ЦРОД 2022 ›

Отбор в ЦРОД 2022

Отбор в ЦРОД 2022

CF 104687C - Сумма 1

CF 104687L - Найти число-2

CF 104687B - Отсортировать массив

CF 104687J - Выбор чисел 3

CF 104687K - Найти число-1

CF 104687I - Выбор чисел 2

CF 104687H - Выбор чисел 1

CF 104687G - Покупка

CF 104687F - Строка-2

CF 104687E - Строка-1

CF 104687D - Сумма 2

CF 104687A - Треугольник