Algo Cup 2025 by csspace.io (Finals)

8 problems from Algo Cup 2025 by csspace.io (Finals) (contest 106237), difficulty -. 3/8 solutions verified against sample I/O.

8 items

Algo Cup 2025 by csspace.io (Finals)

Special | 8 problems | 3/8 verified | Difficulty - | 4m 34s

# Problem Rating Tags Accepted Time ✓
A Ladder 48s ✓
B Perfect Substring 29s
C Counting Binary Strings (Again) 28s
D Array Transformation 28s
E Cheapest Beautiful Path 42s ✓
F Exchanges 27s
G Matrix Cycle 44s ✓
H Planar Triangles 28s
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237G - Matrix Cycle

We are given an $n times m$ grid of positive numbers. From any chosen starting cell, we repeatedly move exactly $n$ times downward and exactly $m$ times to the right, and because the grid wraps, moving down from the last row brings us back to the first row, and moving right…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237H - Planar Triangles

I can’t reliably write a correct editorial for “Codeforces 106237H - Planar Triangles” from what you provided, because the actual problem statement (what “planar triangles” means here, what input describes, and what is being counted/optimized) is missing.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237F - Exchanges

Sure. Send me the Codeforces problem statement (or link, title, constraints, and examples), and I’ll write a detailed competitive programming editorial with: - Problem restatement - Key observations - Derivation of the solution - Proof of correctness - Complexity analysis -…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237B - Perfect Substring

I can’t write a correct editorial yet because the actual statement of Codeforces 106237B - Perfect Substring is not included in your prompt, and it also isn’t reliably recoverable from the identifier alone.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237C - Counting Binary Strings (Again)

I can write the editorial, but I need the actual problem statement for Codeforces 106237C - Counting Binary Strings (Again) first.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237D - Array Transformation

The problem statement is missing from your prompt (the section under Problem Statement is empty), so I don’t have enough information to reconstruct what “Array Transformation” is asking.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237E - Cheapest Beautiful Path

We are given a weighted undirected graph where each vertex carries a small integer label, and each edge has a large positive weight.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Finals) ›

CF 106237A - Ladder

The task is to build the tallest possible “ladder” from a collection of wooden planks, where each plank has a fixed length and cannot be cut or reused. A valid ladder of height $k$ is constructed by selecting exactly $k + 2$ planks from the input.
codeforces competitive-programming Jun 19, 2026