VI UnBalloon Contest Mirror

14 problems from VI UnBalloon Contest Mirror (contest 105900), difficulty -. 14/14 solutions verified against sample I/O.

14 items

VI UnBalloon Contest Mirror

Special | 14 problems | 14/14 verified | Difficulty - | 12m 15s

# Problem Rating Tags Accepted Time ✓
A Ascending mountains 49s ✓
B Boundless Deck 59s ✓
C Collatz-Star of Pain and Suffering 58s ✓
D Delirium at Unballoon 50s ✓
E Elementary Magical School of Words 51s ✓
F Fibonacci 47s ✓
G Graph of Love 1m 2s ✓
H High-Speed Collision 53s ✓
I Inventing Names 49s ✓
J Joining Xegos 55s ✓
K Koga needs you 44s ✓
L Lagrange's Legacy 57s ✓
M Minimum Path 51s ✓
N Na zdrowie 50s ✓
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900J - Joining Xegos

We are given an array of values placed on a shelf, where each value represents a xego piece identified by a large integer.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900E - Elementary Magical School of Words

We are looking at strings of length n formed from the 26 lowercase English letters, but we do not care about the actual letters used.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900I - Inventing Names

We are given a set of existing strings over lowercase English letters, and a maximum allowed length K. The task is to construct a new string that is not in the given set, has length at most K, and is lexicographically as small as possible among all valid choices.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900A - Ascending mountains

We are given a set of mountains labeled from 1 to N, where each label also represents its difficulty level. There are M precedence rules of the form A before B, meaning Isa cannot climb mountain B unless she has already climbed mountain A.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900L - Lagrange's Legacy

We are given three small integers $A$, $B$, and $C$, and then a list of up to 1000 query values $X1, X2, dots, XQ$. For each query value, we must evaluate a fixed cubic expression, take its absolute value, and finally combine all results using bitwise XOR.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900M - Minimum Path

We are given a directed weighted graph where nodes represent gas stations and edges represent one-way roads with travel distances. We start at node 1 and must reach node N. Every valid route from 1 to N has two competing criteria.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900H - High-Speed Collision

Two moving objects are given on a 2D plane, each one represented as a rigid triangle. Each triangle is described by three fixed vertices at time zero, and then the entire triangle translates with a constant velocity vector.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900G - Graph of Love

Each person chooses exactly one other person as their “true love”. From this we build a directed graph on $N$ vertices where every vertex has exactly one outgoing edge, possibly to itself.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900B - Boundless Deck

We are given an infinite collection of cards where each card is labeled by a power of a fixed integer $n$. The first card has value $n^0$, the second $n^1$, the third $n^2$, and so on.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900D - Delirium at Unballoon

We are comparing two containers filled with ice cream: a cylindrical bottle and a cone with an extra dome on top. The bottle is a simple cylinder with radius rL and height hL, completely filled. Its capacity is just the usual cylinder volume.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900N - Na zdrowie

We are given a fixed sequence of length n that is already a permutation of the numbers from 1 to n. This means every number appears exactly once, but we do not know their order. For each query, we are asked about a contiguous segment of this array, from index l to r.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900K - Koga needs you

We are given a single line describing a battle scenario in a simplified Pokémon-type cycle. The line contains a fixed prefix and then a single Pokémon name among three possibilities: Torterra, Staraptor, or Luxray.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900F - Fibonacci

We are given three integers $a$, $b$, and $M$. The task is not to compute a Fibonacci number in the usual sense of “take index and return value”, but instead to evaluate a Fibonacci number whose index is itself a product: we need the value of $f{a cdot b}$, then take it…
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › VI UnBalloon Contest Mirror ›

CF 105900C - Collatz-Star of Pain and Suffering

The problem describes a grid of size $H times W$, where each cell initially stores two integers $A{0,i,j}$ and $B{0,i,j}$.
codeforces competitive-programming Jun 21, 2026