RocketOlymp 2022 9 класс

5 problems from RocketOlymp 2022 9 класс (contest 103590), difficulty -. 3/5 solutions verified against sample I/O.

5 items

RocketOlymp 2022 9 класс

Special | 5 problems | 3/5 verified | Difficulty - | 4m 56s

#	Problem	Time	✓
A	\u041f\u043e\u0434\u0430\u0440\u043e\u043a	48s	✓
B	\u0412\u0435\u043b\u0438\u043a\u0430\u044f \u043f\u043e\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u044c	53s	✓
C	\u0420\u0430\u0441\u0448\u0438\u0444\u0440\u043e\u0432\u043a\u0430 \u043f\u043e\u0432\u0442\u043e\u0440\u044f\u0448\u0435\u043a	2m 10s
D	\u0410\u043d\u043e\u043d\u0438\u043c\u043d\u043e\u0441\u0442\u044c \u043d\u0430\u0448\u0435 \u0432\u0441\u0435	33s	✓
E	Double trios	32s

Practice › Codeforces Solutions › RocketOlymp 2022 9 класс ›

CF 103590C - Расшифровка повторяшек

Let $Sigman = {0,1,2}^n$. Two $n$-trits $x = (x1,dots,xn)$ and $y = (y1,dots,yn)$ are adjacent in an anti-Gray ternary code if and only if $xi neq yi$ for every $1 le i le n$.

Practice › Codeforces Solutions › RocketOlymp 2022 9 класс ›

CF 103590A - Подарок

We are given an array of numbers of length $n$. From this array, a square $n times n$ table is constructed. Each cell at row $j$ and column $i$ is filled with the value $min(ai, aj)$.

Practice › Codeforces Solutions › RocketOlymp 2022 9 класс ›

CF 103590E - Double trios

The problem statement for Codeforces 103590E - Double trios is missing from your message, so I don’t have the actual task definition, constraints, or examples needed to write a correct editorial.

Practice › Codeforces Solutions › RocketOlymp 2022 9 класс ›

CF 103590D - Анонимность наше все

We are given a line of people, each person either potentially infected or healthy, but we never observe their individual state directly. Instead, we receive statements about segments of the line.

Practice › Codeforces Solutions › RocketOlymp 2022 9 класс ›

CF 103590B - Великая последовательность

We are given a sequence of positive integers and a fixed multiplier $x$. The goal is to extend the sequence by adding the smallest possible number of new positive integers so that the final multiset of values can be perfectly partitioned into pairs.