First Masters Championship LATAM 2024

9 problems from First Masters Championship LATAM 2024 (contest 104990), difficulty -. 2/9 solutions verified against sample I/O.

9 items

First Masters Championship LATAM 2024

Special | 9 problems | 2/9 verified | Difficulty - | 11m 3s

#	Problem	Time	✓
A	Apartment Tycoon	56s	✓
B	Balindromes	1m 14s
C	Counting Relative Lists	1m 1s	✓
D	Dynamic Park Pricing	1m 9s
E	Enchanted Labyrinth	1m 42s
F	Friends Reunion at the Park	1m 36s
G	Gridtopia	1m 27s
H	Hidden Textland Pattern	1m 15s
I	Inspecting Spells	43s

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990H - Hidden Textland Pattern

We are given a single string made of lowercase English letters, and we need to find a substring that appears as many times as possible inside it. Among all substrings with the highest frequency, we prefer the longest one.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990I - Inspecting Spells

We are given a collection of strings, each representing a fixed “spell”. We are allowed to rearrange these strings in any order and concatenate them into one long string.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990G - Gridtopia

We are given a rectangular grid where some cells contain artifacts. Each artifact sits at a specific coordinate, and we are only allowed to move from the top-left corner to the bottom-right corner using steps that go either right or down.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990F - Friends Reunion at the Park

We are given a tree, which is a connected graph with no cycles, where every edge represents a path of equal length one. Each query gives us three distinct starting nodes, representing the initial positions of three people inside this tree.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990E - Enchanted Labyrinth

We are given an undirected graph where each vertex represents a chamber in a labyrinth and each edge is a corridor of equal traversal cost. Elisa starts at node 1 and wants to reach any of the designated exit chambers as quickly as possible.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990C - Counting Relative Lists

We are asked to count sequences of length $N$, where each element is chosen from the integers $1$ to $M$, and every pair of adjacent elements must be coprime, meaning their greatest common divisor equals 1.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990D - Dynamic Park Pricing

We are given a parking duration expressed as hours and minutes, which we first convert into a single total number of minutes. The parking fee is not constant over time.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990B - Balindromes

We are given many independent queries. Each query describes an interval on the positive integers, and we must count how many numbers inside that interval have the property that their decimal representation reads the same from left to right and from right to left.

Practice › Codeforces Solutions › First Masters Championship LATAM 2024 ›

CF 104990A - Apartment Tycoon

We start with a single apartment that already produces a fixed monthly rental income. Each additional apartment costs a fixed amount of money, and once purchased it immediately contributes the same monthly income as the initial one.