Индивидуальная олимпиада школьников по информатике и программированию 2020
5 problems from Индивидуальная олимпиада школьников по информатике и программированию 2020 (contest 103360), difficulty -. 0/5 solutions verified against sample I/O.
Индивидуальная олимпиада школьников по информатике и программированию 2020
Special | 5 problems | 0/5 verified | Difficulty - | 6m 17s
CF 103360D - Кроссворд для дроида
Let $n = s + t$ as in (1), and consider a $t$-combination $ct cdots c1$ with $n ct cdots c1 ge 0$ together with the additional adjacency restriction $c{j+1} cj + 1 qquad (t j ge 1).$ Define new integers $c'j = cj - (j-1), qquad 1 le j le t.
CF 103360A - Йода и приставки Си
Let $n = s + t$ as in (1), and consider a $t$-combination $ct cdots c1$ with $n ct cdots c1 ge 0$ together with the additional adjacency restriction $c{j+1} cj + 1 qquad (t j ge 1).$ Define new integers $c'j = cj - (j-1), qquad 1 le j le t.
CF 103360E - Боевые дроиды
I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 103360E - “Боевые дроиды” is missing from your message. Right now I don’t know: - what the input represents (graph, array, game, geometry, etc.
CF 103360C - Древний замок
I can’t write a correct editorial yet because the actual problem statement is missing. Right now I only see the title “Codeforces 103360C - Древний замок”, but there are no details about what the input describes, what needs to be computed, or any constraints.
CF 103360B - Джедайские вычисления
I can’t reliably write a correct editorial for this yet because the problem statement for Codeforces 103360B - “Джедайские вычисления” isn’t included in your prompt.