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

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

8 items

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

Div. 2 | 8 problems | 2/8 verified | Difficulty - | 6m 39s

# Problem Rating Tags Accepted Time ✓
A Favorite Foods 41s ✓
B Sharing Cheerios 2m 31s
C Spice Ratios 32s
D Peter Piper Picked the Perfect Piece of Pizza 45s
E Food Donations 25s
F Norman's N&N's 31s
G Expected Distance 48s ✓
H Coprime Ribs 26s
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986B - Sharing Cheerios

Let $alpha$ be a $t$-combination, so $alpha$ is a $t$-element subset of ${0,1,dots,n-1}$. The operator $partialt alpha$ produces all $(t-1)$-combinations obtained by deleting one element of $alpha$. If $alpha={ct,dots,c1}$, then $$partialt alpha={alphasetminus{cj}mid 1le jle t}.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986G - Expected Distance

We start with a single node and then add nodes one by one. When node i is added, it attaches to one of the previous nodes j with probability proportional to a given weight aj. Once the parent j is chosen, the edge length between i and j is defined as ci + cj.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986H - Coprime Ribs

I don’t have the actual statement for Codeforces 102986H - Coprime Ribs in your prompt, so I can’t reliably reconstruct the problem or write a correct editorial.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986F - Norman's N&N's

I’m missing the actual problem statement for Codeforces 102986F - Norman’s N&N’s, so I can’t reliably reconstruct the solution or write a correct editorial.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986D - Peter Piper Picked the Perfect Piece of Pizza

I’m missing the actual problem statement for Codeforces 102986D - Peter Piper Picked the Perfect Piece of Pizza, so I can’t safely reconstruct the intended model, constraints, or solution.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986E - Food Donations

The prompt is missing the actual problem content. Right now we only have the title “Codeforces 102986E - Food Donations” but no description, input, output, or constraints.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986A - Favorite Foods

The problem describes a person who has a list of favorite foods and is given a sequence of foods they eat over time.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 2 (Beginner) ›

CF 102986C - Spice Ratios

I can’t reliably write a correct editorial for Codeforces 102986C - Spice Ratios without the actual problem statement.
codeforces competitive-programming Jul 4, 2026