UTPC Contest 02-09-24 Div. 2 (Beginner)

8 problems from UTPC Contest 02-09-24 Div. 2 (Beginner) (contest 104968), difficulty -. 3/8 solutions verified against sample I/O.

8 items

UTPC Contest 02-09-24 Div. 2 (Beginner)

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

# Problem Rating Tags Accepted Time ✓
A Pepperoni Paradise 1m 9s ✓
B Pizza Slices 1m 17s ✓
C Running out of Pizza Taco 1m 20s
D Feeding the Kids 1m 26s
E Pizza Expiry 1m 40s
F Pizza Stack 24s ✓
G Slicing the Pizza 28s
H Euclidean Pizza 19s
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968E - Pizza Expiry

Each pizza comes with a structure that can be interpreted as a small graph. There is a central point and a ring of $si$ slice vertices. Every slice vertex is connected to the center with cost $qi$, and each slice is also connected to its two neighbors on the ring with cost $ci$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968D - Feeding the Kids

We are given a sequence of students arriving in a fixed order, and each student consumes a specific number of pizza slices. There are K pizzas prepared, and every pizza must have the same number of slices, call this value X.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968H - Euclidean Pizza

We are given two finite point sets in the plane. One set represents topping points, and the other represents crust points. Every valid pizza slice is formed by choosing the origin together with any two crust points, forming a triangle whose third vertex is fixed at the origin.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968G - Slicing the Pizza

We are given a large set of distinct points on a grid. Each point represents a pepperoni slice, and we are asked to construct a straight line such that the line passes very close to many of these points.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968F - Pizza Stack

We are arranging a permutation of pizzas labeled from 1 to $n$, where each label is the radius of that pizza. Once we choose an order, we look at all pairs of positions in the stack: if a larger pizza appears below a smaller one, we call that pair “proper”.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968C - Running out of Pizza Taco

We are given a line of people before Shelly arrives. Each of those people can take food from a shared pool consisting of pizza slices, tacos, and sauces. Every person can take up to two items freely, where an item is either a pizza slice or a taco.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968B - Pizza Slices

We are given a pile of pizzas, each pizza cut into 8 identical slices. With $n$ pizzas, the total number of slices is fixed at $8n$. These slices must be distributed among $m$ friends. The distribution has two constraints at the same time.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 02-09-24 Div. 2 (Beginner) ›

CF 104968A - Pepperoni Paradise

The pizza is represented as a square grid of size $N times N$, where each cell contains a single alphabet character. Among these characters, only two symbols matter for us: uppercase ‘P’ and lowercase ‘p’.
codeforces competitive-programming Jun 28, 2026