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

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

5 items

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

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

#	Problem	Rating	Tags	Accepted	Time	✓
(none)

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

CF 1044405 - Долгое вычитание

We are given a large integer written on a board. A sequence of operations is applied until the number becomes zero. Each operation depends entirely on the digits currently present in the number.

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

CF 1044404 - Жребий Крижановского

We are given a sequence of numbers representing what each participant announces in a game. The goal is to identify numbers that appear exactly once in the entire sequence. Among those uniquely occurring numbers, we select the smallest value and output it as the winner.

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

CF 1044402 - Прогрессия

Three numbers remain on the board, in their original order, after one element was erased from an arithmetic progression of four integers. We must restore the missing number and also report where it belongs so that the four resulting numbers form an arithmetic progression.

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

CF 1044401 - Том Сойер

We are given three types of tickets: yellow, red, and blue. These tickets can be converted upward in a strict hierarchy. Ten blue tickets can be exchanged into one red ticket, and ten red tickets can be exchanged into one yellow ticket.

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

CF 1044403 - Расклейка афиш

We are given a street with houses numbered from 1 to n. A character walks along the street twice, placing posters on houses according to divisibility rules. On the first pass, every house whose index is divisible by a is selected.