UTPC Contest 10-14-22 Div. 1 (Advanced)

8 problems from UTPC Contest 10-14-22 Div. 1 (Advanced) (contest 103969), difficulty -. 1/8 solutions verified against sample I/O.

8 items

UTPC Contest 10-14-22 Div. 1 (Advanced)

Div. 1 | 8 problems | 1/8 verified | Difficulty - | 5m 38s

# Problem Rating Tags Accepted Time ✓
C Wedding Cake 49s ✓
D Splitting Jellybeans 2m 5s
E Brownie Brawl 32s
F Seeking Starburst 28s
G Gingerbread House Decorations 24s
H Janky Jaffa Cakes 28s
I Ice Cream Orders 27s
J Pudding Passes 25s
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969J - Pudding Passes

The problem statement for Codeforces 103969J - Pudding Passes is missing from your message, so I don’t have enough information to write a correct editorial. Right now I only know the title, but not the rules of the process, the input format, or what needs to be computed.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969I - Ice Cream Orders

The problem statement for Codeforces 103969I - Ice Cream Orders is missing from your message, so I don’t have the actual rules, inputs, or required computations needed to write a correct editorial.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969D - Splitting Jellybeans

Let $G=(V,E)$ be a finite graph. A set $Dsubseteq V$ is dominating when every vertex $vin Vsetminus D$ has a neighbor in $D$. A kernel $Ksubseteq V$ is an independent set such that every vertex $vin Vsetminus K$ has a neighbor in $K$. Let $K$ be a kernel of $G$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969H - Janky Jaffa Cakes

The problem statement for “Codeforces 103969H - Janky Jaffa Cakes” is not included in your prompt, so there is no way to reconstruct the actual task, constraints, or required algorithm.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969F - Seeking Starburst

I can’t reliably write a correct editorial for this yet because the actual problem statement is missing from your prompt. Right now I only see the title “Seeking Starburst”, but no description of what the input/output mean, constraints, or what is being optimized.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969G - Gingerbread House Decorations

The problem statement is missing from the prompt, so there isn’t enough information to write a correct or meaningful editorial. Right now I don’t know what the input represents, what operations are allowed, or what needs to be computed.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969C - Wedding Cake

We are given a sequence of days, and on each day Mel receives a single cake layer ingredient labeled from 1 to 5. Mel is building wedding cakes, and each complete cake must be assembled in strict order from layer 1 up to layer 5.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 10-14-22 Div. 1 (Advanced) ›

CF 103969E - Brownie Brawl

I can’t write a correct editorial yet because the actual problem content for Codeforces 103969E - Brownie Brawl is missing from your prompt.
codeforces competitive-programming Jul 2, 2026