Пригласительный этап. Сириус-2020

5 problems from Пригласительный этап. Сириус-2020 (contest 102747), difficulty -. 3/5 solutions verified against sample I/O.

5 items

Пригласительный этап. Сириус-2020

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

#	Problem	Time	✓
A	\u041b\u0435\u0442\u043e\u0438\u0441\u0447\u0438\u0441\u043b\u0435\u043d\u0438\u0435	1m 30s	✓
B	\u041f\u0440\u043e\u0436\u0435\u043a\u0442\u043e\u0440\u0430	42s	✓
C	\u0420\u0435\u043c\u043e\u043d\u0442 \u0437\u0430\u0431\u043e\u0440\u0430	1m 14s
D	\u0410\u043c\u0435\u0440\u0438\u043a\u0430\u043d\u0441\u043a\u0438\u0435 \u0433\u043e\u0440\u043a\u0438	57s	✓
E	\u0427\u0438\u0441\u043b\u0430	29s

Practice › Codeforces Solutions › Пригласительный этап. Сириус-2020 ›

CF 102747A - Летоисчисление

The problem uses a historical year numbering system where there is no year zero. Years after the beginning of the era are written as positive integers, while years before it are written as negative integers. The sequence of years is therefore: ..., -3, -2, -1, 1, 2, 3, ...

Practice › Codeforces Solutions › Пригласительный этап. Сириус-2020 ›

CF 102747C - Ремонт забора

I can write the editorial, but I need the actual problem statement details first. The statement section in your prompt is empty, and Codeforces 102747C does not expose the full statement from the prompt itself.

Practice › Codeforces Solutions › Пригласительный этап. Сириус-2020 ›

CF 102747E - Числа

I need the actual problem statement or input/output description for Codeforces 102747E, because the statement section is missing and I cannot reliably reconstruct the algorithm, edge cases, or solution from the title alone. Waiting for your answer

Practice › Codeforces Solutions › Пригласительный этап. Сириус-2020 ›

CF 102747D - Американские горки

The problem describes a roller coaster made from two kinds of pieces. The special pieces already exist and each one changes the train speed: when the train enters a special piece it must have one speed and when it leaves it has another.

Practice › Codeforces Solutions › Пригласительный этап. Сириус-2020 ›

CF 102747B - Прожектора

The problem models three projectors standing in a row. They are turned on one second at a time in the repeating order left, middle, right, middle. The left projector can work for A seconds in total, the middle one for B seconds, and the right one for C seconds.