UDESC Selection Contest 2025-1

15 problems from UDESC Selection Contest 2025-1 (contest 105950), difficulty -. 5/15 solutions verified against sample I/O.

15 items

UDESC Selection Contest 2025-1

Special | 15 problems | 5/15 verified | Difficulty - | 9m 51s

# Problem Rating Tags Accepted Time ✓
A Absolute Cinema 30s
B Magic Library 52s ✓
C Clich\u00e9s 51s ✓
D Inside the Matrix 26s
E Enigma 38s ✓
F Frodo and Sam 1m 34s ✓
G Godfather 1m 4s ✓
H Cinematic Hierarchy 41s
I Lost Language 28s
J John Wick 29s
K Kill Bill Vol. 1 29s
L Las Tortuguitas 23s
M Movieguessr 29s
N Ni 25s
O The Martian 32s
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950O - The Martian

The statement for Codeforces 105950O - The Martian (Problema F: Frodo & Sam) is not actually included in the input you provided. Only the header and empty I/O section are present, so there is no definition of the task, constraints, or required computation.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950M - Movieguessr

I’m missing the actual problem statement for 105950M - Movieguessr. The input/output section is empty, so there’s no way to reconstruct what the task is (logic, constraints, or even what is being computed).
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950N - Ni

Sure - please send me the full problem statement (or a link / screenshot text), and I’ll write a complete Codeforces-style editorial. If you want, you can also tell me: - difficulty rating (if known) - whether you want multiple solutions (e.g.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950K - Kill Bill Vol. 1

I can absolutely write that kind of editorial, but I’m missing the only thing that makes it possible: the actual problem statement. Right now you’ve only provided the title and metadata, and “Problema K: Kill Bill Vol.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950L - Las Tortuguitas

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Las Tortuguitas”, but no description of what the input represents, what operations are performed, or what needs to be computed.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950J - John Wick

I don’t have the actual problem statement for Codeforces 105950J - John Wick in your message. Right now only the title is present, so there’s no way to reliably reconstruct the task, constraints, or required output.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950H - Cinematic Hierarchy

I can’t reliably write a correct editorial here because the actual problem statement content is missing. Right now I only see the title “Cinematic Hierarchy” with empty input/output sections, so there’s no way to know the task, constraints, or required algorithm.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950E - Enigma

We are given two integers that describe a hidden pair of numbers. Think of two unknown values $A$ and $B$. We are not given them directly, but instead we are told their sum and the absolute difference between them.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950I - Lost Language

I don’t have the actual statement of Codeforces 105950I - Lost Language in your prompt. What you’ve provided only includes the title and an empty input/output section, so there is no information about what the problem is asking, what operations are allowed, or what…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950D - Inside the Matrix

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now “Codeforces 105950D - Inside the Matrix” is only referenced by name, but there’s no description of the grid/matrix rules, operations, input format, or what needs to…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950B - Magic Library

We are given a single lowercase string and allowed to perform at most one operation: choose two positions and swap the characters at those positions.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950C - Clichés

We are given a sequence of items where each item belongs to some category, represented by integers. The same value can appear multiple times, and each occurrence is distinguishable only by its position in the input.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950A - Absolute Cinema

I can’t write a correct editorial for “Codeforces 105950A - Absolute Cinema” because the actual problem statement is missing. Right now I only see the title and empty Input/Output sections, which isn’t enough to reconstruct what the task is.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950G - Godfather

We are given a rooted structure that evolves over a sequence of operations driven by a binary string. Initially, there are two “states” of the story, each represented by a numeric value: one main value and one auxiliary value.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › UDESC Selection Contest 2025-1 ›

CF 105950F - Frodo and Sam

We are given two parallel sequences of rock types, each sequence being a permutation of the same set of labels. The players are allowed to trim both sequences only from the left and only from the right.
codeforces competitive-programming Jun 21, 2026