UTPC Contest 02-05-21 Div. 1 (Advanced)

9 problems from UTPC Contest 02-05-21 Div. 1 (Advanced) (contest 102947), difficulty -. 1/9 solutions verified against sample I/O.

9 items

UTPC Contest 02-05-21 Div. 1 (Advanced)

Div. 1 | 9 problems | 1/9 verified | Difficulty - | 6m 7s

# Problem Rating Tags Accepted Time ✓
C White Fang 33s
D Firewood 2m 5s
E Food Allocation I 42s ✓
F Hopping Between Lily Pads 27s
G Food Rations 26s
H Jungle Escape 29s
I Food Allocation II 26s
J Camping in the Wild 31s
K Call of the Wild 28s
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947D - Firewood

Let $n,m ge 1$. The goal is to generate all partitions of $n$ into at most $m$ parts, meaning sequences $a1 ge a2 ge cdots ge ak ge 1,quad k le m,quad a1+cdots+ak=n.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947K - Call of the Wild

I don’t have the statement for Codeforces 102947K - Call of the Wild available in the prompt, and I can’t reliably reconstruct it from the title alone without risking inventing details.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947J - Camping in the Wild

I can’t reliably write a correct editorial for Codeforces 102947J - Camping in the Wild without the actual problem statement. Right now the input/output specification and the core task are missing, so any solution I produce would be guesswork and very likely wrong.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947I - Food Allocation II

I can’t reliably write a correct Codeforces editorial for “102947I - Food Allocation II” without the actual problem statement.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947H - Jungle Escape

I’m missing the actual problem statement for Codeforces 102947H - Jungle Escape, and without it I can’t reliably reconstruct the correct model, constraints, or solution approach.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947G - Food Rations

I don’t have the actual statement of Codeforces 102947G - Food Rations available in your prompt, and the rest of the sections depend entirely on the precise rules of the problem (what operations are allowed, what “rations” means, and what is being optimized or checked).
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947F - Hopping Between Lily Pads

I’m missing the actual problem statement for Codeforces 102947F - Hopping Between Lily Pads, so I can’t reliably reconstruct the mechanics, constraints, or required solution.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947E - Food Allocation I

We are given a square matrix of size $n times n$, where each entry describes how much value a particular survivor contributes if assigned to a particular food type.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 02-05-21 Div. 1 (Advanced) ›

CF 102947C - White Fang

I don’t have the actual problem statement for Codeforces 102947C - White Fang in your prompt, so I can’t reliably reconstruct the intended solution or write a correct editorial without guessing.
codeforces competitive-programming Jul 4, 2026