2022-2023 Olympiad Cognitive Technologies, Final Round

10 problems from 2022-2023 Olympiad Cognitive Technologies, Final Round (contest 104235), difficulty -. 7/10 solutions verified against sample I/O.

10 items

2022-2023 Olympiad Cognitive Technologies, Final Round

Special | 10 problems | 7/10 verified | Difficulty - | 13m 45s

# Problem Rating Tags Accepted Time ✓
A \u041a\u0440\u0430\u0441\u0438\u0432\u043e\u0435 \u043e\u043a\u043d\u043e 1m 23s ✓
B \u041c\u0435\u0434 \u0432 \u0441\u043e\u0442\u0430\u0445 1m 30s ✓
C \u0420\u0430\u0437\u0433\u043e\u0432\u043e\u0440 \u043e \u0434\u0435\u0440\u0435\u0432\u044c\u044f\u0445 1m 44s ✓
D \u041d\u0430 \u0443\u0433\u043e\u043b\u043a\u0438 \u043d\u0435 \u0440\u0430\u0437\u0440\u0435\u0437\u0430\u0442\u044c! 58s ✓
E \u0417\u0430\u043f\u0440\u043e\u0441\u044b \u043d\u0430 \u043c\u0430\u0441\u0441\u0438\u0432\u0435 58s ✓
F \u0412\u0435\u0440\u043e\u044f\u0442\u043d\u043e\u0441\u0442\u044c \u0445\u043e\u0440\u043e\u0448\u0435\u0439 \u043f\u043e\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u0438 1m 19s ✓
G \u0425\u043e\u0440\u043e\u0448\u0438\u0435 \u0442\u0430\u0431\u043b\u0438\u0446\u044b 1m 29s
H \u041a\u0440\u0430\u0441\u043d\u043e-\u0441\u0438\u043d\u0438\u0435 \u043c\u0430\u0440\u0448\u0440\u0443\u0442\u044b 1m 2s ✓
I \u041e\u0442\u0433\u0430\u0434\u0430\u0439 \u0434\u0432\u0430 \u0447\u0438\u0441\u043b\u0430 1m 30s
J \u0421\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u0430\u044f \u043a\u043e\u043d\u0444\u0438\u0433\u0443\u0440\u0430\u0446\u0438\u044f 1m 52s
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235G - Хорошие таблицы

We are given a grid of size $n times m$ filled with lowercase Latin letters. From this grid, we consider all possible axis-aligned subrectangles.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235F - Вероятность хорошей последовательности

We generate a random array of length $n$, where each position is independently and uniformly chosen from integers $1$ to $k$. Every one of the $k^n$ arrays is equally likely.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235J - Счастливая конфигурация

We are given an array length $n$ and a prime number $k$ such that $n$ is divisible by $k$. The indices $1..n$ form a permutation $P$, and we are asked to construct such a permutation. The constraint introduces a second hidden object: another permutation $B$ of $1..
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235I - Отгадай два числа

We are interacting with a hidden pair of integers $A$ and $B$, both in the range from $0$ to $10^9$. We do not see them directly. Instead, we can send a query value $X$, and the system returns the value $(A oplus X) + B$, where $oplus$ is bitwise XOR.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235H - Красно-синие маршруты

We are given a directed graph where every vertex has exactly two outgoing edges: one red edge and one blue edge. From any starting vertex, a move consists of repeating a fixed pattern of edge traversals, and we must determine where we end up after applying that pattern many…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235E - Запросы на массиве

We are maintaining a mutable array where two operations repeat over time. One operation asks, for a fixed position i, to look strictly to the right and find the smallest value that is strictly greater than a[i]. The other operation flips the sign of a single element in the array.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235D - На уголки не разрезать!

We are given a rectangular grid of size $n times m$, fully covered by unit cells. A player wants to tile all remaining cells after removing exactly one cell using a specific shape called a “corner tromino”: a shape made of three cells that forms an L, i.e.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235C - Разговор о деревьях

We are working with a tree on $n$ vertices where vertex 1 and vertex 2 are fixed in a special way: the distance between them is exactly $m$, and no pair of vertices in the tree is farther apart than $m$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235B - Мед в сотах

We are given two identical geometric objects on a grid, each object is a regular hexagon of side length 1. Each hexagon is placed in a fixed orientation: two of its edges are vertical, and its lowest vertex is anchored at an integer coordinate point.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Olympiad Cognitive Technologies, Final Round ›

CF 104235A - Красивое окно

We are given a rectangular window of height H and width W. Two cuts are made. First, we choose a vertical cut at some integer position A, splitting the window into a left rectangle of width A and a right rectangle of width W - A.
codeforces competitive-programming Jul 1, 2026