UFPE Starters Final Try-Outs 2025

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

13 items

UFPE Starters Final Try-Outs 2025

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

# Problem Rating Tags Accepted Time ✓
A Autocomplete 54s ✓
B Beautiful Handsome's Canteen 50s ✓
C Coconuts 1m 1s ✓
D Darts 58s ✓
E Elevator 46s ✓
F Four is too much 52s ✓
G Grisi Maps 1m 3s ✓
H Homo Programmius 50s ✓
I Intense Duel 49s ✓
J Judge Fail 44s ✓
K Known Issue 45s ✓
L Legendary Paper Cup 43s ✓
M Mayor 50s ✓
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791A - Autocomplete

We are given a fixed dictionary of words and then a sequence of query strings. For each query, we want to know how many words in the dictionary start with that query as a prefix.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791K - Known Issue

The wall is given as an n by m grid of cells. Each cell is either empty or blocked by a nail. A poster can only be hung on a rectangular region of the wall, and every cell inside that rectangle must be free of nails.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791I - Intense Duel

Two players alternate climbing a coconut tree. On the first climb Samuell takes a fixed amount $x$, and on the second climb Lleumas takes $y$.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791G - Grisi Maps

We are given an undirected weighted graph that models a region. Two special vertices are distinguished: one is the main entrance of a university, and the other is the destination called IC. For every query vertex $x$, we compare two ways of reaching IC.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791D - Darts

Each test describes a simple structured battle: there are n waves of enemies, and the i-th wave contains exactly i balloons. Every balloon in a wave has the same power level k, and the cost of destroying a single balloon is i raised to the power k.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791M - Mayor

We are given a small graph with up to 10 vertices, where every ordered pair of vertices has an associated cost for building a directed edge from one to the other.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791L - Legendary Paper Cup

We are asked to count how many numbers inside a given interval can be expressed in a very specific form: the product of three consecutive integers. Every such number comes from choosing an integer $x$ and forming $x cdot (x+1) cdot (x+2)$.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791J - Judge Fail

Each submission in the contest belongs to exactly one contestant, and each contestant has a personal restriction on which verdicts they can possibly receive. For every submission, the system does not produce a deterministic result.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791H - Homo Programmius

We are given a binary string representing a DNA sequence, where each position is either normal or mutated. A value of 1 indicates a mutation, while 0 indicates a normal gene.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791F - Four is too much

We are given a group of X marathonists who need transportation to a destination. There are N available ride options, and each ride option behaves like a single vehicle that can be used at most once.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791E - Elevator

We are looking at a building with floors numbered from 1 up to n + 1. Pep lives on the top floor, and he wants to go down using an elevator.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791C - Coconuts

We are given a line of kiosks along a beach avenue, each kiosk offering exactly one drink. A traveler starts at satisfaction value 1 and chooses a single contiguous segment of kiosks to walk through.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2025 ›

CF 105791B - Beautiful Handsome's Canteen

We are given a polyline in the plane defined by n points sorted by increasing x-coordinate. The path starts at the first point and proceeds in straight line segments between consecutive points, so the walker moves along a piecewise linear curve.
codeforces competitive-programming Jun 21, 2026