UTPC Contest 02-05-21 Div. 2 (Beginner)

8 problems from UTPC Contest 02-05-21 Div. 2 (Beginner) (contest 102948), difficulty -. 0/8 solutions verified against sample I/O.

8 items

UTPC Contest 02-05-21 Div. 2 (Beginner)

Div. 2 | 8 problems | 0/8 verified | Difficulty - | 5m 52s

# Problem Rating Tags Accepted Time ✓
A Spiciest Snek 32s
B Rapid Jaguar 28s
C White Fang 2m 31s
D Firewood 28s
E Food Allocation I 31s
F Hopping Between Lily Pads 28s
G Food Rations 28s
H Jungle Escape 26s
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948C - White Fang

Let the 2 × 2 × 3 torus be the Cartesian product of directed cycles $C2 times C2 times C3$, with vertex set $V = {(i,j,k) mid i in {0,1}, j in {0,1}, k in {0,1,2}}.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948G - Food Rations

I can’t write a correct editorial without the actual problem statement. Right now the “Problem Statement / Input / Output” sections are empty, and Codeforces problems with the same title can vary significantly in mechanics (greedy, DP, simulation, etc.).
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948H - Jungle Escape

I can’t reliably write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 102948H - Jungle Escape” by itself doesn’t tell me what the graph, grid, or constraints are, so any attempt to derive an algorithm would be guesswork and…
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948D - Firewood

I can’t reliably reconstruct Codeforces 102948D - Firewood from the title alone, and it does not appear in standard indexed problem listings in a way that exposes the statement.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948F - Hopping Between Lily Pads

The problem statement for Codeforces 102948F - Hopping Between Lily Pads is missing from your prompt, so I can’t reconstruct the mechanics (graph structure, allowed moves, constraints, or what is being optimized). An editorial depends heavily on those details.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948E - Food Allocation I

I can’t produce a correct editorial for this yet because the actual problem statement for Codeforces 102948E - Food Allocation I is missing from your prompt.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948A - Spiciest Snek

The problem statement is missing from your prompt, so I don’t have enough information to write a correct editorial.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 2 (Beginner) ›

CF 102948B - Rapid Jaguar

I can write this editorial, but I’m missing the only thing that actually determines the solution: the problem statement.
codeforces competitive-programming Jul 4, 2026