Олимпиада 1С 2026, предметный тур

5 problems from Олимпиада 1С 2026, предметный тур (contest 106434), difficulty -. 5/5 solutions verified against sample I/O.

5 items

Олимпиада 1С 2026, предметный тур

Special | 5 problems | 5/5 verified | Difficulty - | 4m 17s

#	Problem	Time	✓
A	\u0420\u043e\u0431\u043e\u0442-\u043f\u044b\u043b\u0435\u0441\u043e\u0441	49s	✓
B	\u0417\u0430\u0448\u0438\u0444\u0440\u043e\u0432\u0430\u043d\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432	42s	✓
C	\u0411\u044e\u0434\u0436\u0435\u0442\u043d\u0430\u044f \u044d\u043a\u0441\u043a\u0443\u0440\u0441\u0438\u044f	56s	✓
D	\u041e\u043f\u044f\u0442\u044c \u044d\u0442\u0430 \u043c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a\u0430	56s	✓
E	\u041c\u0430\u0441\u0441\u0438\u0432 \u0431\u0435\u0437 \u0442\u0440\u0435\u0443\u0433\u043e\u043b\u044c\u043d\u0438\u043a\u043e\u0432	54s	✓

Practice › Codeforces Solutions › Олимпиада 1С 2026, предметный тур ›

CF 106434B - Зашифрованный массив

We are given an array that we only see in a distorted form. Each element in the observed array could have originally been any integer within a fixed interval around its observed value.

Practice › Codeforces Solutions › Олимпиада 1С 2026, предметный тур ›

CF 106434E - Массив без треугольников

We are given an array that changes over time, where each change updates a single position. After every update, we must count how many subarrays are “good”.

Practice › Codeforces Solutions › Олимпиада 1С 2026, предметный тур ›

CF 106434D - Опять эта математика

We are given a list of positive integers. From this list, we conceptually form every unordered pair of distinct elements. For each pair, we compute the least common multiple of the two numbers, producing a very large multiset of values.

Practice › Codeforces Solutions › Олимпиада 1С 2026, предметный тур ›

CF 106434C - Бюджетная экскурсия

We are given a graph of cities connected by bidirectional roads. Each road has a cost of exactly one step, but it also carries a binary attribute. Some roads are normal, while others are expensive “bridges”.

Practice › Codeforces Solutions › Олимпиада 1С 2026, предметный тур ›

CF 106434A - Робот-пылесос

A robot moves inside a one-dimensional corridor that can be thought of as a segment of integer points from 0 to L. The left wall is at position 0 and the right wall is at position L. The robot starts at position X and initially faces either left or right.