2021-2022 Olympiad Cognitive Technologies, Prefinal Round

8 problems from 2021-2022 Olympiad Cognitive Technologies, Prefinal Round (contest 103567), difficulty -. 8/8 solutions verified against sample I/O.

8 items

2021-2022 Olympiad Cognitive Technologies, Prefinal Round

Special | 8 problems | 8/8 verified | Difficulty - | 6m 13s

#	Problem	Time	✓
A	\u0422\u0440\u0435\u0443\u0433\u043e\u043b\u044c\u043d\u0438\u043a\u0438	42s	✓
B	\u0428\u0430\u0445\u043c\u0430\u0442\u043d\u0430\u044f \u0434\u043e\u0441\u043a\u0430	51s	✓
C	\u0422\u0440\u043e\u043b\u043b\u044c \u0421\u0435\u0432\u0430	43s	✓
D	(\u041d\u0435)\u0434\u043e\u0441\u0442\u0438\u0436\u0438\u043c\u044b\u0439 \u0438\u0434\u0435\u0430\u043b	41s	✓
E	\u0425\u0430\u043a\u0435\u0440\u0441\u043a\u0430\u044f \u0410\u0442\u0430\u043a\u0430	38s	✓
F	\u041c\u0435\u0442\u0440\u043e	45s	✓
G	\u041d\u0435\u043e\u0436\u0438\u0434\u0430\u043d\u043d\u044b\u0439 \u043a\u0440\u043e\u0441\u0441\u043e\u0432\u0435\u0440	56s	✓
H	\u041e\u0441\u043e\u0437\u043d\u0430\u043d\u0438\u0435 \u0434\u0435\u0441\u044f\u0442\u043e\u0433\u043e \u0443\u0440\u043e\u0432\u043d\u044f	57s	✓

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567H - Осознание десятого уровня

The task describes a repeated “folding” process on a discretized grid structure that comes from a checkerboard-like expansion of an $H times V$ grid into a finer lattice of vertices, edges, and cells.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567E - Хакерская Атака

We are dealing with a simple exponential growth model where an initial quantity of viruses expands by a fixed multiplicative factor each second.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567C - Тролль Сева

The problem describes a process where we are effectively interested in whether a specific arithmetic sequence ever produces a number divisible by a given integer $N$. The sequence is fixed and grows by a constant step, starting from a small offset: $2, 5, 8, 11, dots$.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567G - Неожиданный кроссовер

We are given a deterministic two-player movement system on a grid, but instead of thinking in terms of players, it is more useful to think of it as a directed state graph over configurations.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567F - Метро

We are given a long array of values that represent passenger flow at different time moments of the day. A “shift” is defined by three parameters: a starting time index s, a fixed number of trips k, and a constant time gap d between consecutive trips.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567D - (Не)достижимый идеал

We are given a fixed integer $N$ and a range of integers $[L, R)$, meaning all integers $X$ such that $L le X < R$. For each such $X$, we need to determine whether it satisfies a condition involving the greatest common divisor with $N$.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567B - Шахматная доска

We are working with an $N times N$ chessboard where each cell is colored either black or white in the usual alternating pattern. Instead of just counting cells, each cell is assigned a growing integer value, and we need the total sum of all values on the board.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Prefinal Round ›

CF 103567A - Треугольники

We are working with a fixed geometric configuration of 12 equally spaced points placed on a circle. Each triple of distinct points forms a triangle, and we are asked to count how many of these triangles have all three interior angles strictly acute.