AGM 2021, Final Round, Day 1

12 problems from AGM 2021, Final Round, Day 1 (contest 103181), difficulty -. 1/12 solutions verified against sample I/O.

12 items

AGM 2021, Final Round, Day 1

Special | 12 problems | 1/12 verified | Difficulty - | 10m 48s

# Problem Rating Tags Accepted Time ✓
A Crop Circles 39s
B Convoluted Fraction 37s
C Girth 2m 37s
D Markat 33s
E Metrix 32s
F Relay Race 32s
G Complicated Schedule 2m 11s
H Similarities 30s
I Starlight 34s
J Funny Tree 39s
K Wonderland 53s ✓
L Hard work 31s
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181G - Complicated Schedule

Fix $n,t,r$. We consider binary strings $a{n-1}cdots a1a0$ with $a0=0$, containing exactly $t$ ones and decomposable into exactly $r$ maximal alternating runs of $0$’s and $1$’s as in the Ising configurations of Exercise 13.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181K - Wonderland

We are given a connected undirected graph representing “Wonderland”, where each node is a tourist attraction with a fixed value $Hi$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181L - Hard work

I’m missing the actual problem statement for Codeforces 103181L - Hard work. Right now the prompt only contains the template, so there’s no way to reconstruct: - what the input represents - what the output should compute - constraints (which drive the algorithm choice) -…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181J - Funny Tree

I can’t write a correct Codeforces editorial here because the actual problem statement for 103181J - Funny Tree is missing. Right now I only have the title, but no description of what the tree operations or required output are.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181I - Starlight

The problem statement for Codeforces 103181I - Starlight is not included in your prompt, so there is nothing concrete to restate, analyze, or derive an algorithm from.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181C - Girth

Let $mathcal{C}$ be the set of all 5-card subsets of a standard 52-card deck, and for each $C in mathcal{C}$ let the starter be a distinguished choice $k in C$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181H - Similarities

I can’t reliably write an editorial for CF 103181H - Similarities because the actual problem statement is missing from your prompt. Without the statement, I don’t know what the inputs represent, what “similarities” refers to (strings, arrays, graphs, bitmasks, etc.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181F - Relay Race

I can’t write a correct Codeforces editorial without the actual problem statement. Right now I only see the title “103181F - Relay Race”, but no description of what the relay race rules are, what the input represents, or what needs to be computed.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181E - Metrix

The problem statement for “Codeforces 103181E - Metrix” is not included in your message, so there isn’t enough information to write a correct editorial.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181D - Markat

I can absolutely write this editorial in the exact format you want, but I’m missing one critical piece: the actual statement of Codeforces 103181D - Markat.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181A - Crop Circles

I’m missing the actual problem statement for Codeforces 103181A - Crop Circles. Without it, I can’t correctly reconstruct the task, constraints, or solution structure, and any attempt to write a full editorial would be guesswork.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › AGM 2021, Final Round, Day 1 ›

CF 103181B - Convoluted Fraction

I can write the full editorial in exactly that format, but I’m missing the actual problem statement for Codeforces 103181B - Convoluted Fraction.
codeforces competitive-programming Jul 3, 2026