The 2025 ICPC Latin America Championship

12 problems from The 2025 ICPC Latin America Championship (contest 105789), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 2025 ICPC Latin America Championship

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 10m 18s

# Problem Rating Tags Accepted Time ✓
A Ananna 52s ✓
B Brazilian FootXOR 41s ✓
C Coatless in Yakutsk 59s ✓
D Dangerous City 53s ✓
E Exciting Business Opportunities 52s ✓
F Festival Signs 52s ✓
G Game of Pieces 1m 4s ✓
H Horrible Restaurants 52s ✓
I Infinite Arrays 44s ✓
J Just Look Up 50s ✓
K Keep Fighting 52s ✓
L LED Counter 47s ✓
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789B - Brazilian FootXOR

We are given a collection of vectors, each consisting of bits, and we are allowed to choose some of them to form a subset.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789L - LED Counter

Each test case describes the state of a single 7-segment LED digit display, but the display is imperfect and ambiguous.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789K - Keep Fighting

We are simulating a repeating deck of cards used by Bob in a fight against a monster with health $h$. Each card either increases Bob’s power additively, multiplies it, or deals damage directly. Once the deck is exhausted, it resets and can be reused in the same order again.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789J - Just Look Up

We are given a set of points on the surface of a unit sphere in 3D space. Each point is a direction from the origin, so geometrically it can be treated as a unit vector.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789I - Infinite Arrays

We are given a dynamic permutation $P$ of size $K$ and another array $A$. The permutation defines an infinite periodic sequence $P^infty$, formed by repeating $P$ endlessly.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789H - Horrible Restaurants

We are given a collection of restaurants, and for each restaurant we can assign it a number of stars from 0 up to 3. Assigning stars has a cost that depends on the restaurant and the chosen number of stars.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789G - Game of Pieces

We are given a one-dimensional board where each column has a current height. A sequence of operations places pieces that affect contiguous segments of columns.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789F - Festival Signs

We are maintaining a long sequence of positions that initially have no restrictions. Over time, the festival organizers place “signs” that enforce height constraints on contiguous ranges.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789E - Exciting Business Opportunities

We are given a tree of stations and a long sequence of operations applied over time. Each operation is either opening a business at a node of the tree or marking a node as sponsored. The key difficulty is that we do not evaluate these operations globally.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789D - Dangerous City

We are given a city modeled as an undirected weighted graph where intersections are nodes and roads are edges. Each intersection has a danger value, and each road connects two intersections.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789C - Coatless in Yakutsk

We are given a sequence of daily temperatures and a coat that can be used only in limited stretches. Once you wear it for a number of consecutive days, it becomes dirty and cannot be used again until it is washed.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › The 2025 ICPC Latin America Championship ›

CF 105789A - Ananna

We are working with a directed graph whose edges are labeled with characters. The task is not to answer reachability in the usual sense, but to discover all pairs of vertices that can be connected by a walk whose sequence of edge labels forms a palindrome.
codeforces competitive-programming Jun 21, 2026