VII MaratonUSP Freshman Contest

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

10 items

VII MaratonUSP Freshman Contest

Special | 10 problems | 9/10 verified | Difficulty - | 10m 49s

#	Problem	Time	✓
A	Abducting Nathan!	49s	✓
B	Best University ID	46s	✓
C	CCM	2m 11s
D	Diary of Hapiness	42s	✓
E	El Classificador	43s	✓
F	Food Queue	48s	✓
G	Grand Meeting	43s	✓
H	Harada Football Clube	2m 28s	✓
I	Irritating Carlinhos	49s	✓
J	Journey through time	50s	✓

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069H - Harada Football Clube

We are given an integer $N$ representing the number of players in a football team. We must count how many ways we can split these $N$ players into four ordered groups: goalkeeper, defense, midfield, and attack. The goalkeeper group must contain exactly one player.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069J - Journey through time

We are given a sequence of operations applied over time to a set that starts empty. The operations are processed in order, and after each insertion operation we conceptually obtain a new “version” of the set.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069I - Irritating Carlinhos

Two people start at distinct integer coordinates on a 2D grid. Each of them has a movement script made of the same length, where each character instructs a unit move in one of the four cardinal directions.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069F - Food Queue

We are given a stream of students, each one assigned to one of four independent service counters, and each student has a fixed amount of time needed to be served. Each counter operates independently and can serve only one student at a time.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069G - Grand Meeting

We are given a linear metro line with stations arranged in a fixed west to east order. Each station is connected to the next one, and moving between adjacent stations always takes exactly one minute.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069C - CCM

Let $M2(x1,x2,x3,x4)$ denote the 4-way multiplexer. The data variables are $x3x4$, and the select variables are $x1x2$. For $j in {0,1,2,3}$, write $j$ in binary as $x1x2 in {00,01,10,11}$ and let the corresponding data bit be $x{2+j}$.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069E - El Classificador

We are managing a collection of shoe sizes stored in a multiset-like structure where removals are permanent. Each time a customer arrives, they specify a minimum acceptable shoe size, and we must give them the smallest available shoe whose size is at least that threshold.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069D - Diary of Hapiness

We are given a sequence of integers representing how a person felt over a series of days. Each value is between -10 and 10 inclusive, so the sequence encodes short daily mood scores.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069A - Abducting Nathan!

Two players, Thiago and Nathan, are playing a ping-pong style game where the server switches in blocks instead of alternating every two points as in the official rules. Instead, the server changes after every k points scored in total, regardless of who scores them.

Practice › Codeforces Solutions › VII MaratonUSP Freshman Contest ›

CF 104069B - Best University ID

We are given a list of students, where each student has a name and an associated integer. For each integer, we can factor it into primes. Among all prime factors of that integer, we care about the largest prime that divides it.