Moscow team olympiad 2021

10 problems from Moscow team olympiad 2021 (contest 103369), difficulty -. 2/10 solutions verified against sample I/O.

10 items

Moscow team olympiad 2021

Special | 10 problems | 2/10 verified | Difficulty - | 8m 1s

#	Problem	Time	✓
A	Frog traveler	2m 52s
B	\u0423\u043d\u0438\u0447\u0442\u043e\u0436\u0435\u043d\u0438\u0435 \u043c\u0430\u0441\u0441\u0438\u0432\u0430	52s	✓
C	\u041f\u043e\u043b\u0451\u0442 \u043d\u0430\u0434 \u043e\u0437\u0435\u0440\u043e\u043c	36s
D	\u041e\u043f\u0442\u0438\u043c\u0430\u043b\u044c\u043d\u0430\u044f \u0432\u0441\u0442\u0430\u0432\u043a\u0430	30s
E	\u041e\u043d\u043b\u0430\u0439\u043d-\u043a\u0443\u0440\u0441 \u043f\u043e \u0444\u0438\u0437\u043a\u0443\u043b\u044c\u0442\u0443\u0440\u0435	31s
F	Difficult mountain	29s
G	\u0414\u0432\u0435 \u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u043a\u0438	47s	✓
H	\u0415\u0449\u0435 \u043e\u0434\u043d\u0430 \u0438\u0433\u0440\u0430 \u0441 \u0444\u0438\u0448\u043a\u0430\u043c\u0438	30s
I	\u0422\u0440\u0443\u0434\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430	28s
J	\u0414\u0435\u0442\u0441\u043a\u0438\u0439 \u0441\u0430\u0434\u0438\u043a <<\u0422\u043e\u0440\u043c\u043e\u0437\u043e\u043a>>	26s

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369J - Детский садик <<Тормозок>>

I can’t write a correct Codeforces editorial here because the actual problem statement is missing. Right now there’s no information about what the input describes, what needs to be computed, or even the constraints, so any solution would be guesswork.

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369A - Frog traveler

Let $C(n,t,m)$ denote the graph whose vertices are all $t$-combinations $ctldots c1$ with $$nctcdotsc1ge 0,qquad ct-c1<m,$$ and in which two vertices are adjacent when they differ in exactly one entry, that is, one replacement $cj leftarrow cj'$ preserves strict increase and…

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369I - Трудная задача

I cannot reliably produce a correct editorial yet because the problem statement for Codeforces 103369I - Трудная задача is not available from the provided context, and I also cannot safely reconstruct it from memory or assumptions without risking inventing details.

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369H - Еще одна игра с фишками

I don’t have the actual problem statement for Codeforces 103369H (“Еще одна игра с фишками”) in the prompt, so I can’t reliably reconstruct the rules, operations, or intended solution.

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369G - Две сортировки

We are given an array of integers and a single allowed operation that can be used at most once. The operation lets us pick any subset of positions and add the same positive value $k$ to all chosen elements.

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369F - Difficult mountain

I can’t complete a correct editorial for Codeforces 103369F - Difficult mountain yet because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369E - Онлайн-курс по физкультуре

I cannot reliably reconstruct Codeforces 103369E “Онлайн-курс по физкультуре” from the available context alone because the actual problem statement is not present in your prompt, and Codeforces problems with this numbering are not part of the standard…

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369D - Оптимальная вставка

I can write the full editorial in your required format, but the problem statement for Codeforces 103369D - “Оптимальная вставка” is missing from your message.

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369B - Уничтожение массива

We are given a static array of numbers, and then a sequence that tells us the order in which elements of this array get “removed” one by one. After each removal, we are left with several disjoint contiguous segments of still-alive elements.

Practice › Codeforces Solutions › Moscow team olympiad 2021 ›

CF 103369C - Полёт над озером

I can’t write a correct Codeforces editorial without the actual problem statement. Right now the prompt only includes the template, but the core part is empty: For a problem like “103369C - Полёт над озером”, the full description is essential because the…