UTPC Contest 9-17-25 Div. 1 (Advanced)

8 problems from UTPC Contest 9-17-25 Div. 1 (Advanced) (contest 106078), difficulty -. 7/8 solutions verified against sample I/O.

8 items

UTPC Contest 9-17-25 Div. 1 (Advanced)

Div. 1 | 8 problems | 7/8 verified | Difficulty - | 5m 27s

# Problem Rating Tags Accepted Time ✓
C Game on Venus 41s ✓
D Earth 49s ✓
E Mars 48s ✓
F Jupiter 37s ✓
G Saturn 42s ✓
H Uranus 54s ✓
I Neptune 33s ✓
J Pluto 23s
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078J - Pluto

I can write the editorial, but I’m missing the actual problem content. The title “Codeforces 106078J - Pluto” does not map to a publicly available Codeforces problem statement I can reliably identify, and the statement sections in your prompt are empty.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078I - Neptune

We are given several recipes, each describing how a crafting device with a fixed number of slots behaves when it is filled with ingredients. A recipe is a pattern over k positions, where each position is either empty or contains a specific ingredient type.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078H - Uranus

Each probe can be described by two limits and a cost. One limit is how much temperature it can survive, the other is how much wind it can survive. A probe is usable at a location only if it handles both conditions at the same time.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078G - Saturn

We have a target string t and a list of recorded data strings. We may choose any subset of the recorded strings, but their original order cannot change. The chosen strings are concatenated, and the goal is to make the target string appear as a substring as many times as possible.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078F - Jupiter

The problem models a system where you are given a collection of time intervals, and each interval represents an event that can either contribute to or consume some resource, depending on its type.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078D - Earth

We are given a sequence of stone masses arranged in a line. From this line, we are allowed to choose a single contiguous segment. Once a segment is chosen, we evaluate its “enjoyment” based on the distribution of values inside it.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078E - Mars

We are managing a small collection of milk jugs that travel between Mars and Earth. A spaceship trip either goes from Mars to Earth or from Earth to Mars. When a jug reaches Earth on a Mars-to-Earth trip, it is immediately filled.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 9-17-25 Div. 1 (Advanced) ›

CF 106078C - Game on Venus

We are given an array of length 3n. The game proceeds by repeatedly selecting groups of three elements that will be removed together, and each such group is formed in a constrained way.
codeforces competitive-programming Jun 25, 2026