2025 ICPC Universidad Nacional de Colombia Programming Contest

12 problems from 2025 ICPC Universidad Nacional de Colombia Programming Contest (contest 106017), difficulty -. 4/12 solutions verified against sample I/O.

12 items

2025 ICPC Universidad Nacional de Colombia Programming Contest

ICPC/IOI | 12 problems | 4/12 verified | Difficulty - | 6m 35s

#	Problem	Time	✓
A	Perm\u00e1tomo tasters (Easy version)	43s	✓
B	Slanting the board	47s	✓
C	Aboreo Warehouse	33s
D	Cuantos trujos?	28s
E	\u00a1\u00a1Telo, en ti erro!!	26s
F	\u00bfQu\u00e9 es Obo?	24s
H	Cual es Tacafroto	29s
I	Perm\u00e1tomo tasters (Hard Version)	40s	✓
J	Sargento Camelas Rico	24s
K	Timulo and Candies	32s
L	Que es Uxiono?	45s	✓
M	Impossible Numbers	24s

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017L - Que es Uxiono?

The process starts with a single entity and evolves over discrete time steps, measured in minutes. At each minute, some number of new entities is added to the current total.

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017M - Impossible Numbers

Sure - send me the Codeforces problem statement (or a link/name/number), and I’ll write a detailed editorial in a competitive programming style.

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017K - Timulo and Candies

The problem statement is missing from the prompt, so I don’t have the actual task definition (what operations are allowed, what needs to be computed, or what the input/output represent).

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017I - Permátomo tasters (Hard Version)

The problem asks us to look at every ordered pair of positions in an array and compute the sum of the two chosen values. The pair (i, j) is different from (j, i), so there are exactly N² possible sums. We need to find the K-th smallest value among all of these sums.

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017J - Sargento Camelas Rico

I cannot responsibly write a correct editorial for “Codeforces 106017J - Sargento Camelas Rico” yet, because the actual problem statement (input/output description and constraints) is not present in the prompt and is not reliably recoverable from the contest context alone.

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017H - Cual es Tacafroto

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title, but no description of the task, input format, or output requirements.

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017F - ¿Qué es Obo?

Got it - I’ll write a Codeforces-style editorial (with intuition, proofs, implementation details, complexity, etc.). Please send the full problem statement (or a link / screenshot text).

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017E - ¡¡Telo, en ti erro!!

Sure. Please provide the Codeforces problem statement (or link/name), constraints, and any sample input/output if available.

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017D - Cuantos trujos?

I’m missing the actual problem statement for “Codeforces 106017D - Cuantos trujos?”. To write a correct editorial (and not guess the task incorrectly), I need at least one of the following: - full statement text - or input/output format + constraints + sample tests - or a…

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017B - Slanting the board

The board is a grid of integers where every cell is identified by its row and column. Each cell already contains a number, and we are allowed to apply a very specific transformation that affects exactly four cells at a time: the corners of any rectangular subgrid of size at…

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017A - Permátomo tasters (Easy version)

The task asks us to look at every ordered pair of positions in an array. For a pair (i, j), we form a value by adding the two chosen elements. There are N² such values because choosing the first and second position are independent choices.

Practice › Codeforces Solutions › 2025 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 106017C - Aboreo Warehouse

I cannot reliably produce a correct Codeforces 106017C editorial yet because the full official statement is not consistently available in the retrieved sources, and the partial text that appears in the search results is clearly corrupted and duplicated with unrelated problems.