UFPE Starters Final Try-Outs 2026

13 problems from UFPE Starters Final Try-Outs 2026 (contest 106443), difficulty -. 13/13 solutions verified against sample I/O.

13 items

UFPE Starters Final Try-Outs 2026

Special | 13 problems | 13/13 verified | Difficulty - | 11m 38s

#	Problem	Time	✓
A	Amusing Enhancements	45s	✓
B	Balatro	54s	✓
C	Coach Calculations	55s	✓
D	Digits Duel	1m 9s	✓
E	Evaluation	1m 2s	✓
F	Fractions of a Stick	47s	✓
G	Gabmei, the hacker	48s	✓
H	Hungry pou	1m 9s	✓
I	Infinity Money Glitch	46s	✓
J	Journey for Grapes	48s	✓
K	K-Places	48s	✓
L	Linked Letters	1m	✓
M	Meet Me Halfway	47s	✓

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443L - Linked Letters

We are given a fixed dictionary of distinct words. Between any two words, we define a connection rule that depends only on their letters: two words are considered directly compatible if they share at least one common character.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443I - Infinity Money Glitch

We are given a directed graph with weighted edges, where each node represents a position on a board and each edge represents a move that increases or decreases a running score. Starting from node 1, we repeatedly choose any outgoing edge or stay in place with zero gain.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443M - Meet Me Halfway

We are given a circular arrangement of buildings indexed from 0 to m − 1. Movement is only allowed to adjacent buildings on the circle, so from position i you can move to i + 1 modulo m or i − 1 modulo m, and distance between two positions is the shortest number of such…

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443D - Digits Duel

We are given a turn-based game that starts with a collection of integers, initially exactly the numbers from 2 up to $N+1$. Two players alternate turns.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443E - Evaluation

The task is a direct format conversion problem on a fixed-size grid that represents a chessboard. The input is an 8 by 8 character matrix, where each cell is either a chess piece or an empty square.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443G - Gabmei, the hacker

We are given up to 20 distinct points on a 2D plane, each point representing a balloon. A single dart is not limited to a segment or ray; it behaves like an infinite straight line. Once a dart is thrown, every balloon lying exactly on that line is popped.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443K - K-Places

A group of N participants wants to visit tourist spots numbered from 1 to K. Each participant comes with a list of places they refuse to visit.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443A - Amusing Enhancements

We are asked to count how many different ways we can build a sequence of participants whose individual contributions to a “fun score” add up exactly to a given target value $D$. Each participant contributes either 1 unit of fun in a normal state or 2 units if enhanced by AI.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443H - Hungry pou

There are several food items initially placed at integer coordinates on a vertical plane, all of them falling straight down toward the ground line $y = 0$. Each second, every food item moves down by exactly one unit while keeping its horizontal position unchanged.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443B - Balatro

We are given two sequences of integers of equal length. One sequence belongs to Drex, the other to a boss. Before any interaction happens, Drex is allowed to permute his own sequence freely.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443J - Journey for Grapes

We are given a circular arrangement of N vertices, labeled from 0 to N − 1, and a fixed jump size S. Starting from vertex 0, we repeatedly move forward by exactly S positions modulo N, forming an infinite deterministic walk on this cycle.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443F - Fractions of a Stick

We are given a stick of integer length $n$. We choose two distinct integer cut positions from the internal points $1$ to $n-1$, and cut the stick at those positions. This produces three positive integer segments whose lengths depend only on the two chosen cut positions.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2026 ›

CF 106443C - Coach Calculations

We are given two polynomials, one acting as an outer function and one acting as an inner function. The first polynomial $P(x)$ defines how we transform a value once we already have it, and the second polynomial $Q(x)$ defines the value that gets fed into $P$.