Вузовско-академическая олимпиада по информатике 2025, финал

8 problems from Вузовско-академическая олимпиада по информатике 2025, финал (contest 106089), difficulty -. 8/8 solutions verified against sample I/O.

8 items

Вузовско-академическая олимпиада по информатике 2025, финал

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

#	Problem	Time	✓
A	K-\u0438\u043d\u0442\u0435\u0440\u0435\u0441\u043d\u044b\u0435 \u043f\u043e\u0434\u043e\u0442\u0440\u0435\u0437\u043a\u0438	1m 9s	✓
B	\u0413\u043e\u043d\u043a\u0438	1m 14s	✓
C	\u0421\u0442\u0443\u0434\u0435\u043d\u0442 \u0438 \u044d\u043b\u0435\u043a\u0442\u0440\u0438\u0447\u043a\u0438	59s	✓
D	\u0411\u0435\u0433 \u0441 \u043f\u0440\u0435\u043f\u044f\u0442\u0441\u0442\u0432\u0438\u044f\u043c\u0438	49s	✓
E	\u041f\u0440\u043e\u0441\u0442\u043e \u043f\u0435\u0441\u043d\u044f	55s	✓
F	\u0414\u043e\u0441\u0442\u043e\u0439\u043d\u043e\u0435 \u043f\u0440\u043e\u0434\u043e\u043b\u0436\u0435\u043d\u0438\u0435	47s	✓
G	\u041c\u0430\u043a\u0441\u0438\u043c\u0430\u043b\u044c\u043d\u044b\u0439 XOR	58s	✓
H	\u0424\u0451\u0434\u043e\u0440 \u0438 \u0444\u0435\u0440\u0437\u0438	1m 18s	✓

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089E - Просто песня

We are given two sequences of words. The first sequence is a large dictionary of words known to the user, and the second sequence is a song transcription consisting of m words. Every word in both sequences contains exactly one uppercase letter, which marks the stressed character.

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089G - Максимальный XOR

We are given an array of integers. We are allowed to perform exactly one operation: choose two different positions in the array, add a given value x to one chosen element and add another value y to the other chosen element.

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089B - Гонки

We are given an array of daily speeds. We must choose one contiguous segment of days whose length is at least k. For a segment [l, r], its quality is the arithmetic mean of all speeds inside that segment: $$frac{vl + v{l+1} + dots + vr}{r-l+1}$$ The task is to find any segment…

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089D - Бег с препятствиями

We have two infinite running tracks indexed by non-negative positions. The runner starts at position 0 and may choose either track initially. At every step, he tries to move forward by exactly one position.

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089H - Фёдор и ферзи

We are given an n by n chessboard, where n is at most 16, and we must place exactly k queens. A queen behaves normally, attacking along its row, column, and both diagonals. A cell is considered protected if at least one queen attacks it or if a queen stands on it.

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089F - Достойное продолжение

We are given a set of distinct integers, each having at least two digits. For every ordered pair of different numbers, we want to check a simple digit condition: the last digit of the first number must match the first digit of the second number.

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089A - K-интересные подотрезки

We are given a sequence of elements and a parameter that controls what makes a subarray “interesting”. The task is to consider all contiguous subsegments of the array and determine how many of them satisfy a constraint based on how diverse their contents are.

Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2025, финал ›

CF 106089C - Студент и электрички

We are given a railway line of cities arranged in a straight sequence. Each city has a platform with a fixed height. There are train routes, and each route connects an interval of cities. A train route also has two important parameters: a class and a floor height.