2020-2021 Открытая олимпиада школьников по программированию, заключительный этап, тур 1
4 problems from 2020-2021 Открытая олимпиада школьников по программированию, заключительный этап, тур 1 (contest 103194), difficulty -. 0/4 solutions verified against sample I/O.
2020-2021 Открытая олимпиада школьников по программированию, заключительный этап, тур 1
Special | 4 problems | 0/4 verified | Difficulty - | 5m 50s
CF 103194C - Игра на дереве
Let the canonical bases be represented in the form $(alpha1,dots,alphat)$ as in exercise 12, where each $alphai$ is a binary string of length $n$ with exactly one distinguished position equal to $1$.
CF 103194D - Сортировка матрицы
The problem statement section is empty, so there’s not enough information to write a correct editorial. “Сортировка матрицы” could refer to several different tasks (row/column sorting, global flatten-and-sort with constraints, swaps allowed, lexicographic…
CF 103194B - Две люстры
A 3-multicombination of ${0,1,dots,n-1}$ is a weakly increasing triple $d1 le d2 le d3,qquad 0 le di le n-1.$ A universal cycle is a cyclic string $a0 a1 dots a{L-1}$ over ${0,dots,n-1}$ such that every length-3 cyclic window $(ai,a{i+1},a{i+2})quad (bmod L)$ appears exactly…
CF 103194A - Прыжки по шкафам
I don’t have the actual statement of Codeforces 103194A - “Прыжки по шкафам”, and without it any editorial would be guesswork rather than a faithful reconstruction of the solution.