VIII MaratonUSP Freshman Contest

10 problems from VIII MaratonUSP Freshman Contest (contest 104545), difficulty -. 10/10 solutions verified against sample I/O.

10 items

VIII MaratonUSP Freshman Contest

Special | 10 problems | 10/10 verified | Difficulty - | 10m

# Problem Rating Tags Accepted Time ✓
A Agorabusiness 2m ✓
B Balloon Quantum Popping 1m 2s ✓
C Coffee Break 54s ✓
D Divine Music 43s ✓
E Enigma of the Sphinx 50s ✓
F Fierce election 1m 8s ✓
G Gusteseu and Maynotauro 46s ✓
H Hero Morethor 57s ✓
I Initial Ideas 57s ✓
J Joyful Feast of the Gods 43s ✓
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545I - Initial Ideas

We are given a long text formed by exactly N words, and we want to decide whether this text could have originated from a very specific generative process.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545J - Joyful Feast of the Gods

The story describes a character who adds money to a cafeteria account exactly once and then repeatedly spends from it on meals. Each meal has a fixed cost of two units of currency.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545H - Hero Morethor

We are simulating a sequential combat process involving a hero and a list of monsters. The hero starts with an initial power value, and then encounters monsters one by one in a fixed order. Each monster has a strength value.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545F - Fierce election

We are given a competition with multiple gods, where each god initially has a known number of votes. The first god in the list is Zeos, and the rest are competitors.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545G - Gusteseu and Maynotauro

We are given a rectangular grid of size $N times M$, where each cell represents a room. We start at the top-left cell $(1,1)$ and want to reach the bottom-right cell $(N,M)$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545A - Agorabusiness

We are given a set of points in the plane, each representing a tree. If we wrap all trees with a tight rubber band, we get the convex hull of the set. Trees lying on this hull are already on the forest boundary, while trees inside are not.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545E - Enigma of the Sphinx

We are given an evolving collection of “statistics”, each of which is either true or false. Initially there are v true statistics and f false statistics. The key quantity of interest is the fraction of false statistics among all statistics.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545D - Divine Music

We are given a sequence of length $n$, where each position is either a fixed digit from the set ${0,1,2}$ or a missing value marked as $-1$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545B - Balloon Quantum Popping

We are given several groups of items, where each group corresponds to a color of balloons and has an initial count. The container can only carry up to a fixed number of inflated balloons, so we need to reduce the total number of inflated balloons to at most a given limit.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › VIII MaratonUSP Freshman Contest ›

CF 104545C - Coffee Break

We are given a small binary grid representing a table of snacks, where each cell is either a 1 (a cheese ball) or a 0 (a coxinha).
codeforces competitive-programming Jun 30, 2026