UTPC Spring 2026 Open Contest

13 problems from UTPC Spring 2026 Open Contest (contest 106457), difficulty -. 8/13 solutions verified against sample I/O.

13 items

UTPC Spring 2026 Open Contest

Special | 13 problems | 8/13 verified | Difficulty - | 7m 51s

#	Problem	Time	✓
A	Jupiter	44s
B	Bespin	38s	✓
C	Fontaineblue	36s	✓
D	Herryng	35s	✓
E	Gliese-581g	52s	✓
F	Cuqii Scigmah	50s	✓
G	Eridanus Prime	30s	✓
H	Space Trip	23s
I	Yacworld	21s
J	Island	48s	✓
K	Larila	24s
L	Karst	51s	✓
M	Aerth	19s

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457L - Karst

The surface of Karst is described by a one dimensional list of measured heights. We are allowed to replace every height with a new value, but changing a position has a cost equal to the absolute difference between the old and new height.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457M - Aerth

I can’t reliably find a statement for Codeforces 106457M - Aerth, and the provided prompt has no problem description either. Without the actual rules of the task, any editorial would be fabrication, and that would defeat the purpose of the exercise.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457J - Island

We have a collection of n sequences. Each sequence contains every integer in an inclusive interval [ai, bi]. The intervals may overlap, and when the contestants merge their work, equal numbers appear multiple times.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457K - Larila

Sure - I can do that. Please paste the Codeforces problem statement (or link + problem name), and tell me if you want a specific style: - short editorial (contest blog style) - detailed step-by-step explanation - with proofs + complexity - with implementation notes / code…

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457I - Yacworld

Sure. Please provide the Codeforces problem statement (or link/name), and I’ll write a detailed competitive programming editorial covering: - Problem restatement - Key observations - Step-by-step derivation of the solution - Algorithm / data structures - Correctness proof -…

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457H - Space Trip

I can’t reliably write a correct editorial for this yet because the problem statement section is empty. Codeforces IDs alone aren’t enough here, since “106457H - Space Trip” doesn’t have accessible details in this context and guessing would almost certainly produce a…

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457G - Eridanus Prime

The problem describes a fleet of transport ships. Ship i has a cargo capacity Ai. We must choose a single crate size x. A ship can only be used when its capacity can be divided into crates of exactly size x, so the ship contributes if and only if Ai is a multiple of x.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457F - Cuqii Scigmah

We need arrange the values from 0 to n - 1 in a permutation so that a collection of range queries gets the largest possible sum of MEX values.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457E - Gliese-581g

We are asked to construct inputs for a deterministic 64-bit transformation that behaves like a cryptographic mixing function, but is still algebraically reversible in structure. Each query gives a 32-bit target value t.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457D - Herryng

The problem asks for a crate size that gives the largest possible total shipment value. A ship can only be used when its capacity is exactly divisible by the chosen crate size.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457A - Jupiter

I can write the editorial, but the problem statement for Codeforces 106457A “Jupiter” is missing from the prompt. The title alone is not enough to determine the required algorithm, constraints, input format, edge cases, or a correct implementation.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457B - Bespin

The task is essentially about choosing a non-empty subset of ships, where each ship is distinct, and counting how many of those subsets have an odd size. You are given a single integer $n$, representing how many distinct ships are available.

Practice › Codeforces Solutions › UTPC Spring 2026 Open Contest ›

CF 106457C - Fontaineblue

The vault contains paintings identified by their original masterpiece IDs. There were originally N different masterpieces. The replication process should have created two copies of every masterpiece, but exactly two masterpiece IDs failed to receive their second copy.