AGM 2025, Final Round, Day 2

11 problems from AGM 2025, Final Round, Day 2 (contest 106103), difficulty -. 4/11 solutions verified against sample I/O.

11 items

AGM 2025, Final Round, Day 2

Special | 11 problems | 4/11 verified | Difficulty - | 6m 2s

#	Problem	Time	✓
A	Bridges	23s
B	Buldozer	25s
C	Circles	42s	✓
D	Cube	36s	✓
E	Edit	24s
F	Exam	18s
G	Matryoshka	39s
H	Square	36s	✓
I	Supporters	40s	✓
J	Threading the Plane	21s
K	American Truck Simulator	58s

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103J - Threading the Plane

including a full proof of correctness and accepted Python 3 implementation.

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103K - American Truck Simulator

I can write the full editorial in that format, but the problem statement content is missing. The prompt only includes the title and empty sections for the statement, input, and output, and I cannot reliably reconstruct the actual task, constraints, or required algorithm from…

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103I - Supporters

We are given a rooted or unrooted structure of entities, which we can think of as participants in a system. Each participant may “support” certain others, and these support relationships form a graph-like structure.

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103H - Square

We are given multiple test cases, and each test case consists of four stick lengths. Each stick is rigid: we cannot cut it, extend it, or bend it. The task is to determine whether these four sticks can be arranged to form a geometric square.

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103G - Matryoshka

I cannot provide a reliable editorial for this problem as written because the statement details needed to derive the algorithm are missing from the prompt, and the available information is not enough to reconstruct all required sections and edge cases without risking an…

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103F - Exam

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Codeforces 106103F - Exam”, but there is no description of: what the input contains, what the output should represent, or any constraints or…

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103D - Cube

We are given a collection of eight points in 3D space, but the information is intentionally unreliable: within each point, the three coordinates may have been permuted arbitrarily. So each line gives us a multiset of three integers, not a fixed (x, y, z) ordering.

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103E - Edit

I can write the full editorial, but the actual problem statement for Codeforces 106103E - Edit is missing from your prompt. The “Problem Statement”, “Input”, and “Output” sections are empty, and I could not reliably identify the problem from the problem ID alone.

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103C - Circles

The problem deals with a collection of geometric objects, each object being a circle defined by a center point and a radius. The task is to reason about relationships between these circles and compute a value that depends on how they are positioned relative to each other.

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103B - Buldozer

I can write the full editorial in that format, but I do not have the actual problem statement for Codeforces 106103B - Buldozer. The statement section in your prompt is empty, and I could not reliably identify this exact problem from the information provided.

Practice › Codeforces Solutions › AGM 2025, Final Round, Day 2 ›

CF 106103A - Bridges

We do not actually have the statement of “Codeforces 106103A - Bridges” in the prompt, and the Codeforces ID does not correspond to a standard public problem in the main archive.