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

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

9 items

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

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

# Problem Rating Tags Accepted Time ✓
C Spice Ratios 35s
D Peter Piper Picked the Perfect Piece of Pizza 46s ✓
E Food Donations 1m 52s
F Norman's N&N's 28s
G Expected Distance 2m 24s
H Coprime Ribs 30s
I Sharing Cereal II 28s
J Chang's Capricious Cupcakes 2m 27s
K Verbose sandViches 31s
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

CF 102985G - Expected Distance

Let $T(m1,dots,m{n-1},m)$ be the $(n)$-dimensional torus equipped with cross order. Write elements as $(y,a)$ where $y in T(m1,dots,m{n-1})$ and $0 le a < m$ denotes the final component.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

CF 102985J - Chang's Capricious Cupcakes

Let $T(m1,ldots,m{n-1})$ be the $(n-1)$-dimensional torus with cross order $preceq$, and let $x = x1cdots x{n-1}$ be the $N$th element of this torus in cross order. Let $T(m1,ldots,m{n-1},m)$ be the extended torus.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

CF 102985K - Verbose sandViches

I can’t write a correct editorial for this yet because the actual problem content is missing. Right now I only see the title “Verbose sandViches”, but no description of the task, input format, or output requirements.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

CF 102985I - Sharing Cereal II

I can’t write a correct editorial for “Codeforces 102985I - Sharing Cereal II” yet because the problem statement is missing from your prompt. Right now I have no information about: - what the input represents (arrays, graph, queries, etc.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

CF 102985E - Food Donations

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. 1 (Advanced) ›

CF 102985H - Coprime Ribs

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 102985H - Coprime Ribs” isn’t a standard publicly known problem in a way I can reliably reconstruct, and without the statement I would be guessing the entire…
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

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

I can’t write a correct editorial for “Codeforces 102985F - Norman’s N&N’s” because the actual problem statement is missing.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

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

We are given a rectangular pizza placed on a coordinate plane. The bottom-left corner can be thought of as the origin, and the pizza spans a width and height. The chef then makes a set of horizontal cuts and a set of vertical cuts.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UTPC Contest 03-05-21 Div. 1 (Advanced) ›

CF 102985C - Spice Ratios

I can absolutely write this editorial in your required Codeforces style, but I’m missing the most important ingredient: the actual problem statement.
codeforces competitive-programming Jul 4, 2026