UTPC x WiCS Contest 04-05-23 (UT Internal)

9 problems from UTPC x WiCS Contest 04-05-23 (UT Internal) (contest 105079), difficulty -. 2/9 solutions verified against sample I/O.

9 items

UTPC x WiCS Contest 04-05-23 (UT Internal)

Special | 9 problems | 2/9 verified | Difficulty - | 11m 58s

# Problem Rating Tags Accepted Time ✓
A Ordering Cupcakes 1m 11s
B Polkadots 59s ✓
C Frosting Circles 1m 37s
D Spicy Cupcakes 1m 8s
E Cupcake Collecting 1m 30s ✓
F Cupcake Circle 1m 14s
G Sneaking Sprinkles 1m 29s
H Packing Cupcakes 1m 28s
I Cupcake Factory 1m 22s
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079I - Cupcake Factory

We are working on a grid where each cell describes a different kind of terrain in a factory. Sally starts at the top-left corner and wants to reach the bottom-right corner.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079H - Packing Cupcakes

We are simulating a dynamic process on an $N times M$ grid that starts empty and gradually becomes filled cell by cell. Each incoming operation places a cupcake of one of three flavors into a specific empty cell.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079G - Sneaking Sprinkles

We are given a row of cupcakes, each starting with some number of sprinkles. Over time, Alice performs a sequence of operations. In each operation she increases every cupcake’s sprinkles by a fixed amount, taken from an array in a fixed order.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079F - Cupcake Circle

We are given a circular arrangement of positions indexed from 1 to n, where each position may contain a cupcake with a given “deliciousness” value. Suzie starts at position 1 and repeatedly moves forward by one index at a time, wrapping from n back to 1.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079C - Frosting Circles

We are working with a circular “base” region centered at the origin, and several additional circular regions placed on top of it.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079A - Ordering Cupcakes

We are given a party with a fixed number of guests, and each guest names exactly one cupcake flavor they would be satisfied with. Each flavor is identified by an integer from 1 to M.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079D - Spicy Cupcakes

We are given a sequence of cupcake types, each type having a fixed spiciness value. The judge eats all cupcakes in some order, exactly one of each type.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079E - Cupcake Collecting

We are given a square grid of size $N times N$, where each cell is either blocked or usable. A blocked cell is marked with $-1$, and cannot be entered. Every other cell contains a non-negative number representing cupcakes available in that cell.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 04-05-23 (UT Internal) ›

CF 105079B - Polkadots

We are given a minimum threshold $n$, and we want to choose a number $x$ representing the number of polkadots on a cupcake. This number must satisfy two constraints at the same time. First, $x ge n$. Second, $x$ must not be a prime number.
codeforces competitive-programming Jun 27, 2026