UTPC Contest 2-25-26 (Beginner)

8 problems from UTPC Contest 2-25-26 (Beginner) (contest 106387), difficulty -. 7/8 solutions verified against sample I/O.

8 items

UTPC Contest 2-25-26 (Beginner)

Special | 8 problems | 7/8 verified | Difficulty - | 6m 55s

# Problem Rating Tags Accepted Time ✓
A Opening Ceremony 51s ✓
B Ski Buddy 41s
C Olympic Haircut 43s ✓
D Revenge of the (C/K)or(e)ys 1m 13s ✓
E Feed the Beast 48s ✓
F Racing Game 54s ✓
G The Veneto Relay 49s ✓
H Ultimate Figure Skating 56s ✓
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387G - The Veneto Relay

We are given a graph where cities are connected by roads, and each road has an associated danger value. Some cities are marked as milestone cities.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387C - Olympic Haircut

The problem is essentially about choosing a subset of barbers and evaluating what that subset “produces” according to some scoring rule defined in the statement.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387B - Ski Buddy

The statement you provided is incomplete, so it’s not possible to write a correct, problem-specific Codeforces editorial yet. All we currently know is a single hint: “You can brute force this problem. Simulate what happens if Edward were to drop down at each pole.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387E - Feed the Beast

We are given a system of multiple buildings, each associated with a production rate. Time progresses in discrete days, and as time increases, each building accumulates demand for “food boxes” according to its own rate.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387H - Ultimate Figure Skating

We are given a directed system where each element is a node and each rule is a directed edge describing how we can move from one node to another. Each node contributes some value, and when we walk along a directed path, we collect the values of visited nodes.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387D - Revenge of the (C/K)or(e)ys

We are looking at a configuration problem involving a fixed number of positions and two types of indistinguishable objects. There are $2n$ positions in a line, and exactly $n$ of them are labeled as American stones while the remaining $n$ are Swedish stones.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387F - Racing Game

We are given a permutation, which can be viewed as a directed graph where every node has exactly one outgoing edge. Such a structure decomposes into disjoint directed cycles. Each cycle represents a group of positions that rotate among themselves.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 2-25-26 (Beginner) ›

CF 106387A - Opening Ceremony

We are given a rectangular seating layout that behaves like a grid with rows and columns. A person starts at one seat identified by its row and column, and wants to reach another seat in the same grid.
codeforces competitive-programming Jun 19, 2026