UTPC Contest 09-17-21 Div. 1 (Advanced)

11 problems from UTPC Contest 09-17-21 Div. 1 (Advanced) (contest 103295), difficulty -. 4/11 solutions verified against sample I/O.

11 items

UTPC Contest 09-17-21 Div. 1 (Advanced)

Div. 1 | 11 problems | 4/11 verified | Difficulty - | 10m 33s

# Problem Rating Tags Accepted Time ✓
C Bugged Sum 52s ✓
D Cornfield Chase 51s ✓
E Ratman's Puzzle 2m 20s
F Civil War 49s ✓
G Spar-Lord's Voyage 28s
H Land Bridge 48s ✓
I Sling Ring 34s
J The Culk's Incredible Buffet 28s
K Alloy Factory 2m 28s
L Space Tourism 30s
M Ominous Chess 25s
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295K - Alloy Factory

Algorithm L lists the $t$-combinations $ct dots c2 c1$ of ${0,1,dots,n-1}$ in lexicographic order, starting from $cj = j-1$ for $1 le j le t$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295M - Ominous Chess

I don’t have the actual statement for Codeforces 103295M - Ominous Chess, so I can’t responsibly derive an algorithm, complexity, or implementation details yet.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295I - Sling Ring

I can’t write a correct, detailed editorial without the actual problem statement. Right now “Codeforces 103295I - Sling Ring” is just a title, and there’s no information about what the input describes, what operations are allowed, or what needs to be computed.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295L - Space Tourism

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now you’ve only provided the title (“Space Tourism”), but none of the inputs, outputs, constraints, or rules of the task.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295E - Ratman's Puzzle

Let $A$ be a family of $t$-combinations, and let $partial A$ denote its shadow, the family of all $(t-1)$-combinations contained in members of $A$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295J - The Culk's Incredible Buffet

The problem statement section is empty, so there is no way to reconstruct the task, constraints, or required output. Without that, any editorial would be fabricated rather than derived from the actual problem structure, which defeats the purpose of a Codeforces-style explanation.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295F - Civil War

The input is a list of up to $N le 10^3$ integers, each at most $10^6$. These represent the “strength values” of heroes. We are not asked to reason about them individually after preprocessing; instead, the entire system is governed by what they share multiplicatively.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295G - Spar-Lord's Voyage

I can’t produce a correct editorial for this problem yet because the actual problem statement is missing from your prompt.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295H - Land Bridge

We are given a linear world made of segments, where some positions are solid land and others are water. The task revolves around constructing a continuous path of land from a starting region to a target region, but we are allowed to modify the map by building a limited number…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295C - Bugged Sum

We are given a multiset of integers, and a special integer $S$. The “bug” in the system is triggered whenever two chosen numbers sum exactly to $S$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › UTPC Contest 09-17-21 Div. 1 (Advanced) ›

CF 103295D - Cornfield Chase

We are given a grid representing a cornfield where each cell is either blocked by corn or empty. The task is to count how many distinct triangles can be formed such that all three vertices of the triangle lie on cells containing corn.
codeforces competitive-programming Jul 3, 2026