Уральская командная олимпиада по программированию 2024

13 problems from Уральская командная олимпиада по программированию 2024 (contest 105545), difficulty -. 12/13 solutions verified against sample I/O.

13 items

Уральская командная олимпиада по программированию 2024

Special | 13 problems | 12/13 verified | Difficulty - | 12m

# Problem Rating Tags Accepted Time ✓
A \u0411\u0438\u043b\u043b\u0438 \u0411\u043e\u043d\u0441 \u0438 \u043c\u043e\u043d\u0435\u0442\u044b 1m 9s ✓
B \u0428\u043f\u0440\u0438\u0446\u044b 48s ✓
C \u0411\u0438\u0442\u044b\u0439 \u0440\u043e\u043c 1m 6s ✓
D \u0414\u0440\u043e\u0431\u0438\u0442\u0435\u043b\u044c 55s ✓
E \u041f\u043e\u0440\u0442\u0430\u043b\u044c\u043d\u044b\u0435 \u0441\u043e\u043a\u0440\u043e\u0432\u0438\u0449\u0430 54s ✓
F \u0425\u043e\u0440\u043e\u0448\u0435\u0435 \u043d\u0430\u0441\u0442\u0440\u043e\u0435\u043d\u0438\u0435 52s ✓
G \u041b\u044e\u0431\u0438\u043c\u043e\u0435 \u0447\u0438\u0441\u043b\u043e \u0424\u043b\u0438\u043d\u0442\u0430 58s ✓
H \u041f\u0443\u0442\u0435\u0448\u0435\u0441\u0442\u0432\u0438\u0435 \u043a \u043a\u043b\u0430\u0434\u0443 55s ✓
I Hands Up! 30s
J \u041e\u043d\u0438 \u0437\u0430\u0440\u044f\u0436\u0430\u044e\u0442 \u043f\u0443\u0448\u043a\u0443... \u0417\u0410\u0427\u0415\u041c?! 59s ✓
K \u041d\u0443\u0436\u043d\u043e \u0431\u043e\u043b\u044c\u0448\u0435 \u0437\u043e\u043b\u043e\u0442\u0430 57s ✓
L \u041c\u043d\u0435 \u043d\u0435 \u043d\u0440\u0430\u0432\u044f\u0442\u0441\u044f \u044d\u0442\u0438 \u043c\u0430\u0442\u0440\u043e\u0441\u044b! 59s ✓
M \u0414\u0435\u0442\u0441\u0442\u0432\u043e \u043a\u0430\u043f\u0438\u0442\u0430\u043d\u0430 \u0424\u043b\u0438\u043d\u0442\u0430 58s ✓
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545I - Hands Up!

I can write the full editorial in exactly the style you want, but I’m missing the actual problem content for Codeforces 105545I - “Hands Up!”.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545C - Битый ром

We are working with integers represented in binary, and a simple transformation based on bit counts. For every integer $k$ in a range starting from 1 up to $2^n - 1$, we perform a process that repeatedly replaces the number by the number of set bits in its binary representation.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545A - Билли Бонс и монеты

We are given a number written in decimal form, and we need to construct another number that is strictly larger than it while satisfying a digit-wise restriction.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545M - Детство капитана Флинта

We are given a graph whose vertices represent islands and whose edges represent direct travel routes between pairs of islands. The key structural constraint is that this graph contains no cycles, which means every connected component of the graph is a tree.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545L - Мне не нравятся эти матросы!

We are working with an array that changes over time through point updates. After each update, we need to evaluate a global quantity defined over all values that appear in the array. For any value x, we look at all subarrays that do not contain x at all.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545K - Нужно больше золота

We are given an undirected graph with a weight on each vertex and a cost function defined on step lengths of a walk.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545J - Они заряжают пушку... ЗАЧЕМ?!

We are given two arrays of equal length that represent two competing progress tracks over time. One array describes Jim’s daily gains and the other describes the pirates’ daily gains. What matters is not the raw values themselves but the cumulative difference between them.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545H - Путешествие к кладу

We are given a sequence of operations that repeatedly transform an interval of integers. Initially, every integer in a fixed range is considered valid. Each operation shifts the entire current valid range either left or right by a given amount.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545G - Любимое число Флинта

We are given a list of integers. The operation we are allowed to perform is to pick exactly two of these numbers, replace them with their sum, and then consider the greatest common divisor of the resulting multiset.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545F - Хорошее настроение

We are given an array of integers where we are allowed to select a contiguous segment and flip the sign of every element inside it. After performing this operation, we evaluate the resulting array by its minimum value.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545E - Портальные сокровища

We are given an undirected graph that represents locations connected by passages. The task is to determine which parts of this graph remain usable if we repeatedly enter regions where we can explore fully and return to the entry point, but we cannot afford to get stuck in a…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545D - Дробитель

We are given a process that repeatedly produces fractions and then combines them. At some point, we end up with a collection of fractions of the form $frac{a1}{b1}, frac{a2}{b2}, dots, frac{ak}{bk}$.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Уральская командная олимпиада по программированию 2024 ›

CF 105545B - Шприцы

We are given a square board of size $n times n$. We are interested in ordered pairs $(a, b)$, where both $a$ and $b$ are integers between $1$ and $n$, and we want to count how many such pairs satisfy a divisibility condition: at least one of the numbers $a$ or $b$ is divisible…
codeforces competitive-programming Jun 22, 2026