Coding Cup TecNM 2025

11 problems from Coding Cup TecNM 2025 (contest 106113), difficulty -. 6/11 solutions verified against sample I/O.

11 items

Coding Cup TecNM 2025

Special | 11 problems | 6/11 verified | Difficulty - | 5m 50s

#	Problem	Time	✓
A	El Camino del Robot Humanoide	34s	✓
B	La campa\u00f1a de Bob	39s	✓
C	Los ogros tienen capas	21s
D	Dificultad m\u00ednima	19s
E	Una extra\u00f1a sucesi\u00f3n	43s	✓
F	Flujo m\u00ednimo	26s
G	Tortuguitas	43s	✓
H	Redes	25s
I	Cristales M\u00e1gicos	51s	✓
J	Productora Textil	19s
K	Maraton de Peliculas	30s	✓

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113I - Cristales Mágicos

We have N crystals. Each crystal belongs to a family identified by a color name and has a power value. We must select exactly K crystals, with the restriction that no two selected crystals can come from the same family. The objective is to maximize the sum of their powers.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113K - Maraton de Peliculas

The problem describes a collection of movies. Each movie has a release year, a director name, and a rating. We need build the longest possible movie marathon by choosing some of the movies and arranging them in chronological order. A valid marathon has three restrictions.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113J - Productora Textil

I can’t reliably reconstruct Codeforces 106113J “Productora Textil” from the identifier alone, and without the actual statement any editorial would risk inventing the problem structure, which would make the rest (algorithm, proof, code) incorrect.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113H - Redes

I can write the full editorial in that format, but I do not have enough information about Codeforces 106113H - Redes to produce a correct solution. The problem statement section in your prompt is empty, and I could not reliably identify the problem from the title alone.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113G - Tortuguitas

Think of a grid where row $1$ is a simple sequence: $$a{1,j} = j cdot X$$ Each next row is built by taking prefix sums of the previous row: $$a{i,j} = sum{t=1}^{j} a{i-1,t}$$ So each row is a “cumulative accumulation” of all previous rows.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113E - Una extraña sucesión

The teacher builds an "infinite alphabet" by repeating the letters a through z forever. Each block of 26 letters is prefixed by how many complete alphabet cycles came before it. The first few values are: 0a, 0b, ..., 0z, 1a, 1b, ..., 1z, 2a, ...

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113F - Flujo mínimo

I can write the full editorial, but the actual statement for Codeforces 106113F - “Flujo mínimo” is missing from the prompt.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113D - Dificultad mínima

I cannot reliably reconstruct the exact statement of Codeforces 106113D - Dificultad mínima from the available information, and I do not want to hallucinate a solution for a problem whose rules are unknown.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113B - La campaña de Bob

Bob wants to spread a message through a network of cities. The cities are vertices of an undirected graph, and an edge means that information can move between two neighboring cities in one week. Bob does not need to visit every city. He has only two possible visiting orders.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113A - El Camino del Robot Humanoide

A humanoid robot starts at coordinate (0, 0) on a 2D plane and executes a sequence of movements. Each character in the command string represents one move: F moves the robot up, increasing y by 1. B moves the robot down, decreasing y by 1.

Practice › Codeforces Solutions › Coding Cup TecNM 2025 ›

CF 106113C - Los ogros tienen capas

I can’t reliably reconstruct Codeforces 106113C (“Los ogros tienen capas”) from just the title, and the editorial requirements here are strict enough that guessing would very likely produce a completely wrong solution.