2024-2025 ICPC Brazil Subregional Programming Contest

12 problems from 2024-2025 ICPC Brazil Subregional Programming Contest (contest 105327), difficulty -. 6/12 solutions verified against sample I/O.

12 items

2024-2025 ICPC Brazil Subregional Programming Contest

ICPC/IOI | 12 problems | 6/12 verified | Difficulty - | 21m 25s

# Problem Rating Tags Accepted Time ✓
A Attention to the Meeting 1m 13s ✓
B Bacon Number 1m 31s
C Couple of BipBop 1m 34s ✓
D Decrease the Boss Strength 1m 56s
E Enigma of the Jewelry Case 5m 21s
F Fractions are better when continued 54s ✓
G Geography of Rivers 1m 36s
H Harmonics with Interference 1m 11s ✓
I Ingredients that may Harm You 1m 28s ✓
J Journey through Colors 2m
K Karamell 1m 40s
L Lecographically Maximum 1m 1s ✓
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327G - Geography of Rivers

We are given a rooted construction of a single river system that ultimately merges all sources into one final river flowing into the sea. Each source starts as an independent river with a fixed initial amount of water and its own identifier as its name.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327K - Karamell

We are given a multiset of bag sizes, where each bag contains a certain number of identical items. The bags must be processed in a chosen order, one by one. When processing a bag, its entire content is given to whichever of two people currently has fewer total items.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327J - Journey through Colors

We are given an undirected multigraph where each edge connects two cities and carries a color label. The task is to construct a closed walk that uses every edge exactly once, so structurally this is an Euler tour requirement, but with an additional restriction on the order…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327A - Attention to the Meeting

We are scheduling a meeting with $N$ speakers. Each speaker talks for the same integer number of minutes, and between every pair of consecutive speakers there is a fixed 1-minute break.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327E - Enigma of the Jewelry Case

We are given an $N times N$ grid of integers representing a square jewelry box. Each cell contains a distinct number of pearls, and in the intended correct configuration the values increase strictly from left to right along every row and also increase strictly from top to…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327L - Lecographically Maximum

We are given an array of integers, and we are allowed to repeatedly apply an operation that swaps individual bits between two numbers at the same position. If we pick two indices and a bit position, we can exchange whether that bit is 0 or 1 between the two numbers.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327D - Decrease the Boss Strength

We are given a starting value $N$, which we can think of as the “health” of a boss. We also have $M$ operations, called spells. Each spell has two parameters $ai$ and $bi$.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327H - Harmonics with Interference

We are given two binary strings that were transmitted together, but some positions may have been corrupted into a wildcard symbol . One string represents a large binary number, the other represents a much smaller binary number.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327C - Couple of BipBop

We are given an array of length $N$, and we can think of it as a “choreography”, where each position contains a move identifier. Two dancers independently pick starting positions uniformly at random, and from their chosen positions they both move forward step by step.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327I - Ingredients that may Harm You

Each food item is labeled by a number, and that number should be thought of as a multiset of prime factors. If a food has value 12, it really means it contributes ingredients 2, 2, and 3.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327F - Fractions are better when continued

We are given a recursively defined family of fractions built from a repeating nested pattern of the form “one divided by one plus something similar”.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC Brazil Subregional Programming Contest ›

CF 105327B - Bacon Number

We are given a collection of movies, where each movie contains a set of actors. Two actors are considered directly connected if they appear together in at least one movie.
codeforces competitive-programming Jun 22, 2026