Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада

12 problems from Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада (contest 106203), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада

Special | 12 problems | 12/12 verified | Difficulty - | 10m 46s

#	Problem	Time	✓
A	\u041b\u0443\u0447 \u0441\u043c\u0435\u0440\u0442\u0438	1m 4s	✓
B	\u041f\u0438\u0440\u0430\u043c\u0438\u0434\u0430 \u0412\u0438\u0434\u0435\u043d\u0438\u0439	58s	✓
C	\u041f\u043e\u0431\u0435\u0433 \u043e\u0442 \u0437\u043e\u043c\u0431\u0438	1m 4s	✓
D	\u0412\u0435\u043b\u0438\u043a\u0430\u044f \u0442\u0435\u043e\u0440\u0435\u043c\u0430 \u0424\u0435\u0441\u0442\u0435\u0440\u0430	41s	✓
E	\u041b\u0430\u0431\u0438\u0440\u0438\u043d\u0442 \u041a\u043e\u0448\u043c\u0430\u0440\u043e\u0432	56s	✓
F	\u041b\u0430\u0440\u0451\u043a \u0438 \u0434\u0432\u0435 \u043a\u0443\u043a\u043b\u044b	1m 5s	✓
G	\u041f\u043e\u0434\u0430\u0440\u043e\u043a \u0423\u044d\u043d\u0441\u0434\u0435\u0439	51s	✓
H	\u0423\u0436\u0430\u0441\u0430\u044e\u0449\u0438\u0439 \u044d\u043a\u0441\u043f\u0435\u0440\u0438\u043c\u0435\u043d\u0442 \u0423\u044d\u043d\u0441\u0434\u0435\u0439	46s	✓
I	\u041f\u0440\u043e\u0431\u043b\u0435\u043c\u044b \u0431\u0440\u0438\u0442\u044c\u044f	47s	✓
J	LOIS	51s	✓
K	\u0418\u043d\u0446\u0438\u0434\u0435\u043d\u0442\u044b \u0432 \u041d\u0435\u0432\u0435\u0440\u043c\u043e\u0440\u0435	58s	✓
L	\u041c\u0438\u0441\u0442\u0438\u0447\u0435\u0441\u043a\u0438\u0439 \u044d\u043a\u0441\u043f\u0435\u0440\u0438\u043c\u0435\u043d\u0442 \u041f\u0430\u0433\u0441\u043b\u0438	45s	✓

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203D - Великая теорема Фестера

We are given a very small and unusual restriction on the exponent in a power equation of the form $a^n + b^n = c^n$. Unlike classical number theory settings where $n$ is large, here $n$ is guaranteed to be either 0 or 1.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203L - Мистический эксперимент Пагсли

We are given an array of integers that changes over time through point updates. After each update, we must be able to answer how many positions in the array have a specific “balance” property defined using XOR.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203K - Инциденты в Неверморе

We are given a set of people placed on a number line. Each person sits at a fixed coordinate and has three main attributes: an initial intelligence value, a teamwork value, and a way to repeatedly convert intelligence into teamwork using a discrete operation that both reduces…

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203J - LOIS

We are given an array of length n whose elements are integers in the range [0, k]. This array is treated as a multiset with order irrelevant for the condition, since the only properties that matter are the sum of elements and the product of elements.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203H - Ужасающий эксперимент Уэнсдей

We are given an array of positive numbers. We must choose three distinct positions $i, j, k$ and evaluate a symmetric expression formed by ratios of these values.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203G - Подарок Уэнсдей

We are given a source string s and two target strings t1 and t2 whose total length equals A cut defines the boundaries of pieces. With k cuts, we obtain k+1 pieces.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203C - Побег от зомби

We are interacting with a hidden point on a 2D integer grid. Initially, there is a point $(x0, y0)$ that we do not know.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203E - Лабиринт Кошмаров

We are given a tree, meaning a connected graph with no cycles, where each vertex is a room and each edge is a corridor. Movement in the original graph is only along edges. The twist is that movement is not actually restricted to adjacent nodes anymore.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203B - Пирамида Видений

We are given a triangular array with n rows. Row i contains exactly i integers. The process starts from the top row and repeatedly destroys rows one by one until only the bottom row remains.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203I - Проблемы бритья

We are given a grid representing a face. Each cell is marked as either a required shaving area, a forbidden area, or an irrelevant area. The goal is to determine whether we can remove all required cells marked with “+” using a razor.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203F - Ларёк и две куклы

We are given two integers representing values stored in two separate “cursed dolls”. Let us call them the first value and the second value. We are also given two parameters that define a synchronized operation.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая командная олимпиада ›

CF 106203A - Луч смерти

We are maintaining a dynamic set of points on the plane. Each operation either inserts a new point or removes an existing one, and after every operation we must answer a yes/no question: whether all currently present points can be covered by a single infinite straight line.