Сириус.2020.Ноябрь.Очный отбор

6 problems from Сириус.2020.Ноябрь.Очный отбор (contest 102739), difficulty -. 3/6 solutions verified against sample I/O.

6 items

Сириус.2020.Ноябрь.Очный отбор

Special | 6 problems | 3/6 verified | Difficulty - | 7m

#	Problem	Time	✓
B	\u041d\u0430\u0440\u0443\u0442\u043e	1m 24s
C	\u041f\u043e\u0434 \u0434\u043e\u0436\u0434\u0451\u043c	1m 12s	✓
D	\u0418\u0433\u0440\u0430 \u0432 \u0433\u043e\u0440\u043e\u0434\u0430	49s
E	\u0421\u0430\u0448\u0430 \u0438 \u0437\u0430\u0447\u0451\u0442	1m 21s
F	\u0421\u0430\u0448\u0430 \u043e\u043f\u044f\u0442\u044c \u0434\u0435\u043b\u0430\u0435\u0442 \u0437\u0430\u0434\u0430\u0447\u0443 \u043f\u0440\u043e \u043f\u0440\u043e\u0441\u0442\u044b\u0435 \u0447\u0438\u0441\u043b\u0430	1m 13s	✓
G	\u041f\u043b\u0430\u043d \u0414	1m 1s	✓

Practice › Codeforces Solutions › Сириус.2020.Ноябрь.Очный отбор ›

CF 102739E - Саша и зачёт

I can't write a correct editorial or provide a correct solution for this problem because the actual problem statement is missing. The prompt only includes the title, empty sections for "Problem Statement", "Input", and "Output", but none of the information describing the task.

Practice › Codeforces Solutions › Сириус.2020.Ноябрь.Очный отбор ›

CF 102739B - Наруто

I can't write a correct editorial for this problem because the essential information is missing. The prompt only includes the problem title, "Codeforces 102739B - Наруто", while the sections for the statement, input, and output are empty.

Practice › Codeforces Solutions › Сириус.2020.Ноябрь.Очный отбор ›

CF 102739G - План Д

We have n independent subtasks that must be completed during m consecutive days. Each subtask has an allowed time interval: it can be done on any day from si to fi.

Practice › Codeforces Solutions › Сириус.2020.Ноябрь.Очный отбор ›

CF 102739F - Саша опять делает задачу про простые числа

The task is to make every fitness tracker value acceptable to Sasha. A value is acceptable if it is either a prime number or a power of two. For each recorded number, we need to find the smallest acceptable number that is not smaller than the recording.

Practice › Codeforces Solutions › Сириус.2020.Ноябрь.Очный отбор ›

CF 102739D - Игра в города

I can write this editorial, but the problem identifier in the request appears to be inconsistent. Codeforces Gym 102739D is "Игра в города" (the city-name game), while the title and statement you supplied are not included in the prompt.

Practice › Codeforces Solutions › Сириус.2020.Ноябрь.Очный отбор ›

CF 102739C - Под дождём

Polina has a fixed route home. The first part of the route is an uncovered street that takes t1 minutes, and the second part is an alley under trees that takes t2 minutes. She may choose when to leave school, but she has to arrive no later than time d.