Пригласительный этап ВсОШ по информатике, Сириус, 2021

0 problems from Пригласительный этап ВсОШ по информатике, Сириус, 2021 (contest 104439), difficulty -. 0/0 solutions verified against sample I/O.

5 items

Пригласительный этап ВсОШ по информатике, Сириус, 2021

Special | 0 problems | 0/0 verified | Difficulty - |

# Problem Rating Tags Accepted Time ✓
(none)
Practice › Codeforces Solutions › Пригласительный этап ВсОШ по информатике, Сириус, 2021 ›

CF 1044394 - Задача из ЕГЭ

We are given three powers of two, determined by exponents $a$, $b$, and $c$, and we form the integer $$x = 2^a + 2^b - 2^c.$$ The value is guaranteed to be positive, and the exponents $a$ and $b$ are different.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Пригласительный этап ВсОШ по информатике, Сириус, 2021 ›

CF 1044395 - Бизнесмен Василий

We are given a sequence of integers that represent financial transactions recorded over time. We must split this sequence into exactly three contiguous, non-empty parts. Each part corresponds to a “month” in which we sum all values inside that segment.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Пригласительный этап ВсОШ по информатике, Сириус, 2021 ›

CF 1044392 - Ёлочки

The picture contains a single tree drawn on square cells. The trunk is always one cell wide and runs vertically through the whole tree. The tree has beauty n, which means there are exactly n branches on each side of the trunk.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Пригласительный этап ВсОШ по информатике, Сириус, 2021 ›

CF 1044391 - Пятистенок

We are given three lengths. Two of them describe the lengths of logs used in construction: one type of log has length a and another has length b, with a < b. The third number c is the total length of a single wooden beam that must be cut into pieces.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Пригласительный этап ВсОШ по информатике, Сириус, 2021 ›

CF 1044393 - Соревнование делимости

We are given a segment of consecutive integers from $A$ to $B$, inclusive. Two people are counting inside this segment with different rules: one counts how many numbers are divisible by $K$, the other counts how many numbers are divisible by $M$.
codeforces competitive-programming Jun 30, 2026