Cataratas do Pinhão 2025

14 problems from Cataratas do Pinhão 2025 (contest 106050), difficulty -. 7/14 solutions verified against sample I/O.

14 items

Cataratas do Pinhão 2025

Special | 14 problems | 7/14 verified | Difficulty - | 8m 21s

#	Problem	Time	✓
A	Analysis of a Hike	28s
B	Binarical Garden	29s
C	Cavern of Runes	55s	✓
D	Dilemma of Movies	38s	✓
E	Extreme Mathematics	29s
F	Framed Photo	25s
G	Great Tourist	22s
H	Has a Unilestep ever existed?	25s
I	Itinerary of a Tourist	59s	✓
J	Jocund Lecture	41s	✓
K	K Common Interests	42s	✓
L	Liberty from Graphs	55s	✓
M	Mirage of the Waterfalls	22s
N	Name of the Marathon?	31s	✓

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050M - Mirage of the Waterfalls

The problem statement is missing from your prompt, so there’s no way to correctly derive the solution, complexity, or even the underlying task structure.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050K - K Common Interests

We are given a collection of strings, all of equal length, and we want to pair them up in such a way that within each pair, the two strings share a long common prefix. The goal is to maximize a threshold value $k$, where every paired pair must agree on their first $k$ characters.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050J - Jocund Lecture

We are given a tree rooted at node 1, where every edge has a weight. For each node, we can compute the distance from the root by summing edge weights along the unique path from node 1 to that node. This distance is then reduced modulo $10^5$.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050H - Has a Unilestep ever existed?

I can’t write a correct editorial for this problem as-is because the actual problem statement is missing. Right now there’s no description of what “Has a Unilestep ever existed?” is asking, so I would have to guess the task, constraints, and intended solution.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050G - Great Tourist

The problem statement for Codeforces 106050G - Great Tourist is not included in your prompt, so there’s no way to reliably reconstruct the intended solution or write a correct editorial.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050F - Framed Photo

The problem statement for Codeforces 106050F - Framed Photo is missing from your prompt, so I cannot responsibly write a correct editorial yet.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050A - Analysis of a Hike

The problem statement for Codeforces 106050A - Analysis of a Hike is not included in your prompt, so I don’t have enough information to write a correct editorial without guessing.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050N - Name of the Marathon?

The problem asks us to count votes for the name of a programming marathon. Each vote is either 1, meaning the first proposed name, or 2, meaning the second proposed name. After counting the votes, we print the name that received more votes.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050L - Liberty from Graphs

We are given a graph that starts empty and then grows over time. Each query adds one new edge, either red or blue, between two vertices.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050I - Itinerary of a Tourist

We are given a city modeled as a weighted undirected graph with up to 200k locations and roads. Each road has a travel time. Among all locations, only the first P (with P up to 20) are interesting tourist spots.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050E - Extreme Mathematics

I cannot reconstruct Codeforces 106050E exactly from the official statement because the problem page itself is not available in the accessible contest archive text here.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050D - Dilemma of Movies

We are given a set of people attending a movie planning session, and a collection of movies that can either be selected or not.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050C - Cavern of Runes

The problem gives several independent groups of numbers, called panels. Each panel contains a short sequence of positive integers. From each panel we are allowed to discard at most one element, and after that we take the greatest common divisor of what remains.

Practice › Codeforces Solutions › Cataratas do Pinhão 2025 ›

CF 106050B - Binarical Garden

I can’t write a correct editorial without the actual problem statement. Right now the prompt only gives the title “Codeforces 106050B - Binarical Garden”, but no description of what the garden is, what operations are allowed, or what needs to be computed.