UTPC Contest 12-01-23 Div. 2 (Beginner)

7 problems from UTPC Contest 12-01-23 Div. 2 (Beginner) (contest 104835), difficulty -. 5/7 solutions verified against sample I/O.

7 items

UTPC Contest 12-01-23 Div. 2 (Beginner)

Div. 2 | 7 problems | 5/7 verified | Difficulty - | 8m 35s

#	Problem	Time	✓
A	Baklava Layers	1m 1s	✓
B	Baklava Cutting	1m 15s
C	Baklava Baking	1m 5s	✓
D	Baklava Batches	1m	✓
E	Deep Dish Cleaning	1m 44s
F	Sweetest Piece	1m 26s	✓
G	The Floor is Baklava	1m 4s	✓

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 2 (Beginner) ›

CF 104835G - The Floor is Baklava

We are given a grid where each cell represents a piece of baklava that can tolerate a limited number of times being stepped on. Every friend starts at the top-left corner and tries to reach the bottom-right corner by moving one cell at a time in the four cardinal directions.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 2 (Beginner) ›

CF 104835E - Deep Dish Cleaning

We are given a circular arrangement of teeth, where some intervals are covered by retainers. These retainers partition the circle into several free arcs. Each free arc is a contiguous segment of teeth that must be cleaned.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 2 (Beginner) ›

CF 104835F - Sweetest Piece

We are given a rectangular grid of size $n times m$, where each cell contains a height value. Think of this grid as a landscape of baklava pieces with different elevations. Zeynep repeatedly pours syrup onto some starting cells.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 2 (Beginner) ›

CF 104835D - Baklava Batches

We are given two arrays of the same length. One array represents customer orders, where each value is the number of baklavas a customer wants. The other array represents how many baklavas are currently prepared in each batch.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 2 (Beginner) ›

CF 104835B - Baklava Cutting

We start with a square pastry of side length l. Mila repeatedly performs a geometric operation that replaces the current square with a smaller square formed by joining midpoints in a symmetric way.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 2 (Beginner) ›

CF 104835C - Baklava Baking

We are looking at 9-digit numbers that represent possible baklava layer counts. Each such number is a valid configuration, so the search space is simply all integers from 100,000,000 to 999,999,999 inclusive. There are two conditions attached to a valid configuration.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 2 (Beginner) ›

CF 104835A - Baklava Layers

We are given several independent bakery orders. Each order describes a stack of layers, where the first layer has some initial thickness and every next layer becomes exactly one unit thicker than the previous one.