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

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

8 items

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

Div. 2 | 8 problems | 0/8 verified | Difficulty - | 17m 1s

# Problem Rating Tags Accepted Time ✓
A Spookeepy 5m 9s
B Ternary Nightmare 1m 21s
C Spooky Hallway 1m 28s
D Nightmare on 24th 1m 27s
E Candy Eating 1m 24s
F Haunted House 1m 27s
G Pumpkin Patch 1m 26s
H Speedway Evacuation 3m 19s
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346A - Spookeepy

We are given a fixed point on a 2D grid representing where we currently stand inside a mansion. Along with it, we are given a list of other points scattered across the plane. The task is to identify which of these points is closest to our position using Euclidean distance.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346G - Pumpkin Patch

We are given a grid where each cell behaves like a terrain type in a small maze. The traveler starts from exactly one cell marked S and must reach a unique exit cell marked E. Movement is allowed in the four cardinal directions, and each move costs one unit of time.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346F - Haunted House

We are given a building modeled as an undirected graph where rooms are nodes and doors are edges. Harry starts in a specific room and wants to reach any of several exit rooms. At the same time, there are multiple ghosts placed in fixed rooms.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346E - Candy Eating

We are given several types of candy. Each type has a fixed number of pieces available and a fixed tastiness per piece.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346D - Nightmare on 24th

We are given a row of buildings indexed from left to right, where each building contains a certain number of students. Freddy always starts from the first building and can only move forward in order.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346B - Ternary Nightmare

We are given a sequence of characters consisting only of 0, 1, and 2. We want to choose a contiguous segment of this sequence such that within that segment, the number of 2 characters does not exceed a given limit k.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346H - Speedway Evacuation

We are given a line segment of integer positions from 0 to n. Several students stand on integer points between 1 and n−1, and multiple students may share the same position.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC Contest 09-13-24 Div. 2 (Beginner) ›

CF 105346C - Spooky Hallway

We are given a binary string representing a line of lanterns, where each position is either lit or unlit. In one move, we are allowed to pick any contiguous segment and flip every bit inside it, turning zeros into ones and ones into zeros.
codeforces competitive-programming Jun 23, 2026