2024-2025 Московская олимпиада школьников по информатике, 10-11 класс
12 problems from 2024-2025 Московская олимпиада школьников по информатике, 10-11 класс (contest 106373), difficulty -. 4/12 solutions verified against sample I/O.
2024-2025 Московская олимпиада школьников по информатике, 10-11 класс
Special | 12 problems | 4/12 verified | Difficulty - | 5m 52s
CF 106373F2 - Планетная система - 2
I’m missing the actual problem statement for “Codeforces 106373F2 - Планетная система - 2”, and without it I can’t reconstruct the model, constraints, or intended solution path.
CF 106373E2 - Оптимальный опенспейс - 2
I can write this editorial, but the problem data you provided has a mismatch: Codeforces Gym 106373E2 “Оптимальный опенспейс - 2” is an output-only optimization problem, not a normal algorithmic problem with input/output requirements.
CF 106373F1 - Планетная система - 1
I can write the full editorial, but I’m missing the actual problem statement for Codeforces 106373F1 “Планетная система - 1”.
CF 106373E1 - Оптимальный опенспейс - 2
I can’t write a correct editorial for this specific problem yet because the actual statement is missing from your prompt.
CF 106373D1 - Красивые раскраски 2047 - 1
We are given an undirected planar graph. Each vertex represents an object that must receive one of k colors. A coloring is valid if every edge connects two vertices of different colors. The task is to count how many valid assignments of colors exist.
CF 106373D2 - Красивые раскраски 2047 - 2
Sure. Please provide the Codeforces problem statement (or link, title, constraints, and examples), and I’ll write a detailed competitive programming editorial covering: - Problem restatement and observations - Key insight / derivation - Algorithm explanation - Proof of…
CF 106373C2 - Уникальные подстроки - 2
We are given a single string consisting of lowercase characters. The task is to analyze all of its contiguous substrings and count how many of them are “unique in the global sense”, meaning each counted substring appears in the original string exactly once.
CF 106373C1 - Уникальные подстроки - 1
We are given a string and need to determine how many different non-empty substrings it contains. Two substrings are considered the same if their sequence of characters is identical, even if they appear at different positions.
CF 106373B2 - Мяу-мяу! - 2
I can write the full editorial, but I need the actual problem statement for Codeforces 106373B2. The statement text is not available in the prompt, and I could only verify that the problem exists in the Codeforces gym contest, not recover the contents of the task.
CF 106373A2 - Классифайд - 2
I cannot produce a correct editorial yet because the full statement for Codeforces 106373A2 - Классифайд - 2 is not included in your prompt, and it is not reliably recoverable from the provided context.
CF 106373B1 - Мяу-мяу! - 1
Sure. Please provide the Codeforces problem statement (or link, name, and constraints), and I’ll write a detailed competitive programming editorial covering: - Problem restatement - Key observations - Derivation of the algorithm - Proof of correctness - Complexity analysis -…