2025 ICPC Gran Premio de Mexico 3ra Fecha

12 problems from 2025 ICPC Gran Premio de Mexico 3ra Fecha (contest 106063), difficulty -. 7/12 solutions verified against sample I/O.

12 items

2025 ICPC Gran Premio de Mexico 3ra Fecha

ICPC/IOI | 12 problems | 7/12 verified | Difficulty - | 6m 57s

#	Problem	Time	✓
A	Archmage's Crystals	26s
B	Bytelandia's stones	24s
C	Colorful Polygon	28s
D	Doubled Sequence II	45s	✓
E	El Juego del Calamar	43s	✓
F	Fantastic Robot	45s	✓
G	Gatuno's Descent into Psychopathy	37s	✓
H	Heritage of Acatl\u00e1n	45s	✓
I	Isaac and MOD Convolution	28s
J	Juan vs Frank	39s	✓
K	Kilometric Intersection	34s	✓
L	Los Ratones III	23s

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063J - Juan vs Frank

The problem reduces the whole story to a single economic decision repeated for as many friends as possible. Each friend requires buying one identical item that costs a fixed amount of money, and Juan has a limited budget.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063K - Kilometric Intersection

The problem asks us to measure how much two road segments on a number line overlap. Each segment is a closed interval, so it includes both endpoints, but the answer is based on length, meaning a single touching point contributes zero.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063L - Los Ratones III

I’m missing the actual problem statement for Codeforces 106063L - Los Ratones III, and without it I can’t reliably reconstruct the intended solution or write a correct editorial.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063H - Heritage of Acatlán

We are given two strings. The first one is a long “spell” string $S$, and the second is a shorter pattern string $T$. The core quantity of interest is the number of ways to pick indices from $S$ so that the characters at those indices, read in order, form exactly $T$.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063G - Gatuno's Descent into Psychopathy

The problem models a value that decreases by the same multiplicative factor after every operation. Gatuno starts with a heart size H1. After each bite, the current heart size is multiplied by (B - 1) / B, so every operation makes the value smaller.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063I - Isaac and MOD Convolution

I’m missing the actual problem statement for Codeforces 106063I - Isaac and MOD Convolution, and without it I can’t safely reconstruct the intended solution.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063F - Fantastic Robot

We are given a grid of size $N times M$, where each cell is either free or blocked. A robot starts at a specific free cell and wants to reach a target free cell.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063E - El Juego del Calamar

We are given a tower shaped as a sequence of floors. Each floor contains a small number of rooms, and between consecutive floors there are directed stairs that connect some rooms on floor t to rooms on floor t+1.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063D - Doubled Sequence II

The task asks us to build a sequence of length 2n containing every number from 1 to n exactly twice. For a number i, the two copies must be separated by exactly i positions, which means if their indices are l and r, then r - l = i + 1. This is a classic Langford pairing variant.

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063C - Colorful Polygon

Got it. Please paste the Codeforces problem statement (or link + problem name), and I’ll write a full competitive programming editorial for it. If you want, also tell me the level of detail you expect (short / standard / very detailed with proofs and implementation notes).

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063A - Archmage's Crystals

Sure - please paste the full Codeforces problem statement (or link + key details). Once you send it, I’ll write a proper competitive programming editorial with: - intuition - step-by-step derivation - optimal algorithm - complexity analysis - edge cases - reference…

Practice › Codeforces Solutions › 2025 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 106063B - Bytelandia's stones

I can write the full editorial, but the response will exceed the message length limit if I include every requested section, the full solution, traces, and tests in one message. I’ll provide it in two parts: 1. Problem Understanding through Algorithm Walkthrough. 2.