Турнир Архимеда 2021

12 problems from Турнир Архимеда 2021 (contest 103600), difficulty -. 5/12 solutions verified against sample I/O.

12 items

Турнир Архимеда 2021

Special | 12 problems | 5/12 verified | Difficulty - | 14m 10s

# Problem Rating Tags Accepted Time ✓
A \u041e\u043f\u0435\u0440\u0430\u0446\u0438\u0438 \u0441 \u0434\u0435\u0432\u044f\u0442\u043a\u0430\u043c\u0438 1m 5s ✓
B Blinds 2m 12s
C \u0423\u043f\u0440\u043e\u0449\u0435\u043d\u043d\u043e\u0435 \u0441\u043a\u0440\u0435\u0449\u0438\u0432\u0430\u043d\u0438\u0435 32s
D \u0414\u043b\u0438\u043d\u043d\u0430\u044f \u0442\u0435\u0440\u0440\u0438\u0442\u043e\u0440\u0438\u044f 33s
E \u041c\u0435\u0434\u0438\u0446\u0438\u043d\u0441\u043a\u0430\u044f \u0434\u0438\u0430\u0433\u043d\u043e\u0441\u0442\u0438\u043a\u0430 4m 47s ✓
F Obstacle Course 33s
G Resolution 32s
H \u0422\u0430\u0431\u043b\u0438\u0446\u0430 39s ✓
I Two Operations 36s
J \u0425\u0438\u043c\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u0442\u043e\u0447\u043d\u043e\u0441\u0442\u044c 1m 1s ✓
K Class Optimization 36s
L Grass Field 1m 4s ✓
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600K - Class Optimization

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “103600K - Class Optimization”, but no description of the input, output, or task.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600G - Resolution

The problem statement for Codeforces 103600G - Resolution is not included in your prompt, so I don’t have enough information to write a correct editorial.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600I - Two Operations

I don’t have the statement of Codeforces 103600I - Two Operations available in the prompt, and it’s essential for writing a correct editorial (especially since the structure, constraints, and even what the “two operations” are can completely change the solution).
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600D - Длинная территория

I’m going to stop for a second here because the task cannot be completed correctly yet. The full problem statement for Codeforces 103600D (“Длинная территория”) is missing from your prompt, and the name alone is not sufficient to reliably reconstruct the…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600F - Obstacle Course

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only know the title “Obstacle Course”, but there are no details about what the grid/graph/constraints are, what operations are allowed, or what needs to be computed.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600E - Медицинская диагностика

We are given a patient who may suffer from exactly one disease among $k$ candidates. There are $n$ available medical tests. Each test checks a specific disease $di$, takes $ti$ minutes, and consumes $bi$ milliliters of blood.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600C - Упрощенное скрещивание

The statement you pasted is corrupted, so the actual problem content (what “simplified crossing” means, what the inputs/outputs are) is missing. Without that, any editorial would be guessing, which would make the solution meaningless.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600B - Blinds

Let $Sigman = {0,1,2}^n$. Two $n$-trits $x = (x1,dots,xn)$ and $y = (y1,dots,yn)$ are adjacent in an anti-Gray ternary code if and only if $xi neq yi$ for every $1 le i le n$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600A - Операции с девятками

We are interacting with a hidden integer $N$ that starts somewhere in the range $[1, 10^9]$. We cannot read it directly. Instead, we can apply four operations that modify the current value stored inside the judge. Two operations always succeed: adding 9 and multiplying by 9.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600L - Grass Field

We are given a set of vertical line segments on a plane. Each segment represents a blade of grass standing on the ground line $y = 0$, extending upward at some fixed $x$-coordinate, with a given height.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600J - Химическая точность

We are given several available solutions, each characterized by a salt concentration. We are allowed to take some integer number of grams from each solution, with an upper limit of 10⁴ grams per solution.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2021 ›

CF 103600H - Таблица

At its core, this task describes an interactive system where you are allowed to make up to 300 queries, after which you must output a single integer $N$ that was supposedly “chosen” in advance.
codeforces competitive-programming Jul 2, 2026