Подмосковная олимпиада школьников – 2024, Заключительный этап

4 problems from Подмосковная олимпиада школьников – 2024, Заключительный этап (contest 105118), difficulty -. 0/4 solutions verified against sample I/O.

4 items

Подмосковная олимпиада школьников – 2024, Заключительный этап

Special | 4 problems | 0/4 verified | Difficulty - | 6m 46s

#	Problem	Time
A	\u041f\u0440\u043e\u0438\u0437\u0432\u0435\u0434\u0435\u043d\u0438\u044f	1m 37s
B	\u0422\u0430\u0438\u043d\u0441\u0442\u0432\u0435\u043d\u043d\u044b\u0439 \u044f\u0437\u044b\u043a	1m 42s
C	\u0418\u0433\u0440\u0430 \u0441 \u0437\u0430\u0433\u0430\u0434\u043e\u0447\u043d\u043e\u0439 \u0441\u0442\u0440\u043e\u043a\u043e\u0439	1m 56s
D	\u0423\u0432\u0435\u043b\u0438\u0447\u0438\u0432\u0430\u044e\u0449\u0438\u0435\u0441\u044f \u043e\u0442\u0440\u0435\u0437\u043a\u0438	1m 31s

Practice › Codeforces Solutions › Подмосковная олимпиада школьников – 2024, Заключительный этап ›

CF 105118D - Увеличивающиеся отрезки

We are maintaining a collection of numbered segments on a number line. Each segment starts with a given interval, and all initial segments share the same length, though that fact mainly matters as a structural hint rather than something we explicitly exploit.

Practice › Codeforces Solutions › Подмосковная олимпиада школьников – 2024, Заключительный этап ›

CF 105118A - Произведения

We are given an $n times n$ table that was originally constructed from an unknown sequence $a1, a2, ldots, an$. Every off-diagonal cell contains the product of two elements of this sequence, specifically $B{i,j} = ai cdot aj$ for $i neq j$.

Practice › Codeforces Solutions › Подмосковная олимпиада школьников – 2024, Заключительный этап ›

CF 105118C - Игра с загадочной строкой

We are given a string s that contains lowercase letters and wildcard characters ?, and another string t consisting only of lowercase letters. Before anything else happens, all ? characters in s must be replaced by lowercase letters chosen by us.

Practice › Codeforces Solutions › Подмосковная олимпиада школьников – 2024, Заключительный этап ›

CF 105118B - Таинственный язык

We are given two kinds of words. One group contains short words, all of equal length a, and there are n distinct words of this type. The other group contains long words, all of equal length b, and there are m distinct words of this type, with a < b.