UNICAMP Selection Contest 2025

12 problems from UNICAMP Selection Contest 2025 (contest 106038), difficulty -. 11/12 solutions verified against sample I/O.

12 items

UNICAMP Selection Contest 2025

Special | 12 problems | 11/12 verified | Difficulty - | 10m 29s

#	Problem	Time	✓
A	Salvador	45s	✓
B	Astana	50s	✓
C	Jo\u00e3o Pessoa	52s	✓
D	Luxor	1m 6s	✓
E	Guadalajara	53s	✓
F	Chapec\u00f3	48s	✓
G	Dhaka	1m 4s	✓
H	Campo Grande	58s	✓
I	Moscow	24s
J	Gramado	1m 5s	✓
K	Online	50s	✓
L	Campina Grande	54s	✓

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038I - Moscow

The problem statement is missing, so there’s no way to correctly reconstruct what Codeforces 106038I - Moscow is asking. Right now I only see the input/output placeholders without any description of the task, constraints, or operations.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038B - Astana

We are given a chronologically sorted list of distinct integers, where each integer represents a day on which Bernardo went to the gym. The goal is to determine the longest streak of consecutive calendar days present inside this list.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038E - Guadalajara

We are given a short string of up to 15 characters representing coins in a line. Each coin is either H (heads) or T (tails).

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038K - Online

We are trying to reconstruct an unknown binary string of length $N$ by interacting with a judge. Each time we submit a candidate string, the judge compares it against the hidden password and returns how long the two strings match from the beginning.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038H - Campo Grande

We are given a set of distinct fish names, all equally likely to be chosen. Jake wants to identify the chosen fish by asking yes or no questions, and he is allowed to ask any question he wants, as long as the answer partitions the remaining candidates into two groups.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038C - João Pessoa

We are given a circular arrangement of parentheses. The string contains only '(' and ')', and the total number of opening and closing brackets is equal. We are allowed to take a prefix of the string and move it to the end, effectively rotating the string.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038L - Campina Grande

There are several independent groups of items, each group representing a competition. For each competition $i$, Fmota initially owns $ai$ shirts. Time is measured in years starting from year 0 up to year $k$.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038G - Dhaka

There are $n$ tuk-tuks arranged in a strict ranking where position 1 is the best and position $n$ is the worst. Each tuk-tuk has a hidden score, and the ordering is always strictly determined by these scores: higher score means better position, and all scores are distinct at…

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038D - Luxor

We are given a sequence of integers representing transactions that are accumulated one by one into a running sum. The machine computing this sum has a fixed integer range determined by a parameter $k$, so the running total must always stay inside a symmetric interval around zero.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038J - Gramado

We are given a collection of items, where each item has two values attached to it. One value represents a benefit, interpreted as “how much you learn”, and the other represents a cost or pain, interpreted as “how much it hurts”.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038F - Chapecó

We are given a ranking of $n$ teams, ordered from best position $1$ to worst position $n$. Each position has an associated “happiness” value, but instead of being arbitrary, the sequence follows a very specific shape: it first never increases as we go from position $1$…

Practice › Codeforces Solutions › UNICAMP Selection Contest 2025 ›

CF 106038A - Salvador

We are tracking a vote among four fixed candidates, the turtles Rafael, Leonardo, Donatello, and Michelangelo. Each candidate already has some number of votes, and there is a pool of remaining votes that have not yet been cast.