IX MaratonUSP Freshman Contest

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

10 items

IX MaratonUSP Freshman Contest

Special | 10 problems | 10/10 verified | Difficulty - | 7m 39s

# Problem Rating Tags Accepted Time ✓
A Arc surveillance 49s ✓
B Battle in space 46s ✓
C Cosmic candidates 42s ✓
D Dividing the solar pizzas 42s ✓
E Excavating Mercury 45s ✓
F Festival of the Moon 42s ✓
G Genealogy of aliens 49s ✓
H Honor to Saturn 45s ✓
I Investigating Mars 51s ✓
J Jupiter's Dinner 48s ✓
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272A - Arc surveillance

We are given positions of occupied cells arranged around a circular prison with labels from 1 to 360. Because the structure is circular, cell 360 is adjacent to cell 1, so any contiguous surveillance interval may wrap around this boundary.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272J - Jupiter's Dinner

We are given a sequence of requests arranged in a line, where each position corresponds to a person who ordered a specific type of dish.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272H - Honor to Saturn

We are given a linear sequence of asteroids, each colored either a or b. We are allowed to choose any contiguous segment of this sequence, remove it, and then glue its ends together to form a cycle.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272G - Genealogy of aliens

We are looking at a population that evolves in perfectly rigid generations. The first generation starts with some number of individuals, call it $a$.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272E - Excavating Mercury

The horizon of Mercury is described as a line of mountains, each position having a given height. We are allowed to perform only one type of operation: reduce the height of any mountain by removing material.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272C - Cosmic candidates

We are given a group of $n$ people, where $n$ is divisible by 3, and these people are already partitioned into teams of exactly 3 members each. Each team will only agree to participate in a competition if at least two of its three members are convinced to go.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272D - Dividing the solar pizzas

We are given an even number of friends, say 2n, and each friend has a single integer value representing a pizza flavor preference. The group wants to order exactly n pizzas, and each pizza must be made from two different friends’ preferences.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272I - Investigating Mars

We are given a rectangular grid where each cell is either empty, a wall, or the unique starting position of a robot. The robot starts with an initial direction encoded in that starting cell, and then repeatedly applies a deterministic movement rule.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272F - Festival of the Moon

We are observing a single festival where every participant bought exactly one ticket. There are two ticket types: a normal ticket costing v and a discounted lunar ticket costing exactly half of that, v/2, where v is guaranteed to be even.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › IX MaratonUSP Freshman Contest ›

CF 105272B - Battle in space

Two players take turns writing a number. First, the opponent announces an integer n. After seeing it, we choose our own integer m. Whoever writes the larger number wins immediately.
codeforces competitive-programming Jun 23, 2026