Олимпиада 1С, отборочный тур 2025-2026

8 problems from Олимпиада 1С, отборочный тур 2025-2026 (contest 106293), difficulty -. 8/8 solutions verified against sample I/O.

8 items

Олимпиада 1С, отборочный тур 2025-2026

Special | 8 problems | 8/8 verified | Difficulty - | 8m 12s

# Problem Rating Tags Accepted Time ✓
A \u0421\u0440\u0435\u0434\u043d\u0435\u0435 \u0438 \u043c\u0435\u0434\u0438\u0430\u043d\u0430 55s ✓
B \u041e\u0442\u0431\u043e\u0440\u043e\u0447\u043d\u044b\u0439 \u044d\u0442\u0430\u043f 56s ✓
C \u041a\u043e\u0441\u044f \u043b\u044e\u0431\u0438\u0442 \u0431\u0438\u0442\u043c\u0430\u0441\u043a\u0438! 58s ✓
D \u041c\u0443\u0441\u044f \u0438 \u043a\u0430\u043a\u043e\u0439-\u0442\u043e XOR 45s ✓
E \u0423 \u041c\u0443\u0441\u0438 \u043f\u0440\u043e\u0431\u043b\u0435\u043c\u044b \u0441 \u0440\u0435\u0448\u0435\u043d\u0438\u0435\u043c... 1m 23s ✓
F \u041c\u0443\u0441\u044f \u0438 \u0437\u0430\u043a\u043b\u0438\u043d\u0430\u043d\u0438\u044f 1m 2s ✓
G \u041c\u0443\u0441\u044f \u0438 \u0441\u043b\u043e\u0436\u043d\u0430\u044f \u043f\u0440\u043e\u0433\u0443\u043b\u043a\u0430 58s ✓
H \u041c\u0430\u0440\u0448\u0440\u0443\u0442\u044b, \u043a\u0432\u0430\u0440\u0442\u0430\u043b\u044b, \u0434\u043e\u0441\u0442\u0430\u0432\u043a\u0430 \u043f\u0438\u0446\u0446\u044b 1m 15s ✓
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293D - Муся и какой-то XOR

We are given an array of integers and asked to extract as many disjoint contiguous segments as possible such that each chosen segment has XOR equal to zero.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293H - Маршруты, кварталы, доставка пиццы

We are given a grid with very large width and up to 200k rows. In every row, only a contiguous segment of cells belongs to a city, and these segments are guaranteed to overlap between consecutive rows so that the whole shape forms one connected orthogonal region without gaps…
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293G - Муся и сложная прогулка

We are working on a circular array of heights. Each position in the array represents a location, and each location has a height value. A pointer starts at position 1, and then a sequence of operations is applied. There are two types of operations.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293C - Кося любит битмаски!

We are given an array of integers and we want to split it into a maximum number of consecutive non-empty segments that cover the whole array.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293E - У Муси проблемы с решением...

We are given several topics, each with a certain number of tasks. Think of this as an array where each position stores how many problems of that type still need to be solved. A day consists of choosing one topic as the “main” topic.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293F - Муся и заклинания

We are given a sequence of integers written in a book, and we want to count how many contiguous segments of this sequence have a sum that lies within a given interval $[l, r]$.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293B - Отборочный этап

Vasya starts with some number of solved contest problems and an existing contest that contains a fixed number of tasks.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › Олимпиада 1С, отборочный тур 2025-2026 ›

CF 106293A - Среднее и медиана

We are given two fixed integers $a$ and $b$, and we are allowed to choose a third integer $c$. Once $c$ is chosen, we form a triple $(a, b, c)$.
codeforces competitive-programming Jun 18, 2026