2023-2024 Квалификационный тур Уральского четвертьфинала ICPC

11 problems from 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC (contest 105424), difficulty -. 2/11 solutions verified against sample I/O.

11 items

2023-2024 Квалификационный тур Уральского четвертьфинала ICPC

ICPC/IOI | 11 problems | 2/11 verified | Difficulty - | 9m 27s

# Problem Rating Tags Accepted Time ✓
A \u0421\u0435\u0440\u0435\u0434\u0438\u043d\u0430 \u0438\u0433\u0440\u044b 25s
B \u0423\u0436\u0438\u043d \u0434\u043b\u044f \u0438\u043d\u0442\u0440\u043e\u0432\u0435\u0440\u0442\u043e\u0432 27s
C \u041f\u043b\u043e\u0445\u0438\u0435 \u0441\u0442\u0430\u0432\u043a\u0438 50s ✓
D Klyukalo 1m 23s ✓
E \u041c\u0430\u0441\u043a\u0430 \u0434\u043b\u044f \u043c\u043e\u043d\u0441\u0442\u0440\u043e\u0432 21s
F \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0438\u0439 \u043d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0438\u0439 \u043e\u0431\u0449\u0438\u0439 \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u044c 28s
G \u041f\u0440\u043e\u0433\u0440\u0435\u0441\u0441\u0438\u0432\u043d\u044b\u0439 NoSQL 21s
H \u041c\u0430\u0440\u0433\u043e \u043f\u043e\u043a\u0438\u0434\u0430\u0435\u0442 \u041c\u0435\u0433\u0430\u0431\u0430\u0439\u0442\u0431\u0443\u0440\u0433 19s
I Snakes\&Snakes 1m 40s
J Binary Trees 1m 32s
K Apocalypse 1m 41s
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424H - Марго покидает Мегабайтбург

The problem statement section is empty, so there isn’t enough information to reconstruct what “Марго покидает Мегабайтбург” is asking or what the solution should do.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424G - Прогрессивный NoSQL

I can write the full Codeforces-style editorial, but I’m missing the actual problem statement for 105424G - “Прогрессивный NoSQL”.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424F - Наибольший наибольший общий делитель

The problem statement section is empty in your prompt, so I don’t have the actual definition of what needs to be computed (inputs, allowed operations, and what “maximum GCD” refers to in this context).
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424C - Плохие ставки

We are choosing how to distribute a small number of identical improvements across a small set of items. Each item has an initial probability of being in a favorable state, and each improvement increases that probability by a fixed step until it saturates at full certainty.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424E - Маска для монстров

I don’t have the statement of Codeforces 105424E (“Маска для монстров”) available in this context, and I can’t reliably reconstruct the problem from the title alone without risking inventing details.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424B - Ужин для интровертов

I cannot reliably reconstruct a correct editorial for “Codeforces 105424B - Ужин для интровертов” from the available information because the actual problem statement is not accessible in the sources I was able to retrieve, and the number “105424B” does…
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424A - Середина игры

I don’t have the actual statement of Codeforces 105424A (“Середина игры”) available in this context, and I can’t safely reconstruct it from the title alone without risking inventing details that don’t match the problem.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424K - Apocalypse

We are given a convex polygon that represents an initial infected region on an infinite plane. Over time, the infection expands outward in a very structured but not explicitly geometric way: the only guarantee is that the “shape family” preserves radial ordering from the…
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424I - Snakes\&Snakes

We are given a one-dimensional board of size $N$, where a token starts at cell 1 and wants to reach cell $N$. Between these endpoints, some cells contain “snakes” that push the token left by a fixed amount whenever it lands there.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424J - Binary Trees

We are given two rooted binary trees on the same set of vertices labeled from 0 to N−1. The first tree is the initial configuration, and the second tree is the target configuration.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2023-2024 Квалификационный тур Уральского четвертьфинала ICPC ›

CF 105424D - Klyukalo

We are given a construction made of $N$ independent parts. Each part has a required standard weight $si$, and the current configuration has weight $ai$.
codeforces competitive-programming Jun 23, 2026