UNICAMP Freshman Contest 2025

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

11 items

UNICAMP Freshman Contest 2025

Special | 11 problems | 11/11 verified | Difficulty - | 11m 46s

#	Problem	Time	✓
A	Neymar at Santos	56s	✓
B	We're Competing	1m 7s	✓
C	Hacking the Matrix	1m 1s	✓
D	MA141	1m	✓
E	Esteche vs Yvens	53s	✓
F	F128	1m 5s	✓
G	GPT in Fury	1m 9s	✓
H	La Vaca Saturno Saturnino	1m 36s	✓
I	Aura Farming	49s	✓
J	Tigrinho	1m 11s	✓
K	Rofofo's Test	59s	✓

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962K - Rofofo's Test

We are given a machine model where memory is arranged as several cachelines, and each cacheline contains many 8-bit variables. Every variable holds a value from 0 to 255, and all arithmetic is performed modulo 256, so values wrap around after 255. Two operations are available.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962J - Tigrinho

We are given a 3 by 3 board. Each cell is either a digit from 1 to 9 or a wildcard symbol. The board participates in a scoring system based on five special lines: the three rows and the two diagonals.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962H - La Vaca Saturno Saturnino

We are given a sequence of snapshots of a queue. Each snapshot is a full ordered list of all students currently in the queue at some moment in time, and these snapshots are shown in chronological order.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962I - Aura Farming

We are given a set of problems, each described by two numbers. The first number is a threshold requirement: Beraldo can only solve that problem if his current aura is at least that value. The second number is a reward: if he solves the problem, his aura increases by that amount.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962G - GPT in Fury

The task is about detecting which words in a long transcript have been corrupted by a transformation process. You are given a single line containing thousands of space-separated words.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962E - Esteche vs Yvens

We are given a single pile of stones and two players who alternate turns, starting with Yvens. On each turn, the current player must remove either one stone or two stones from the pile.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962B - We're Competing

We are given a long string S with no spaces, which is a noisy transcription of some original text. The transcription process may have corrupted up to K individual characters, meaning at most K positions in the original text were replaced by different characters.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962C - Hacking the Matrix

We are given an $N times N$ binary matrix. We are allowed to freely reorder rows and columns any number of times, independently. After these permutations, we want to find the largest possible “C-shaped” pattern consisting only of ones.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962D - MA141

We are given four points in the plane in a fixed order, A, B, C, D. The task is to determine whether connecting them in that order, including the edge from D back to A, forms a geometric square. This is not a “set of four points” problem where we can reorder arbitrarily.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962F - F128

We are simulating a particle moving inside a one-dimensional corridor of length $d$. The particle starts at position $k$, measured from the left wall, and initially moves to the right with speed $v$. The motion is perfectly linear between collisions.

Practice › Codeforces Solutions › UNICAMP Freshman Contest 2025 ›

CF 105962A - Neymar at Santos

We are looking at a simplified financial model tied to football performance. There are $P$ teachers, each earning a fixed monthly salary $R$.