Delft Algorithm Programming Contest 2025 (DAPC 2025)

12 problems from Delft Algorithm Programming Contest 2025 (DAPC 2025) (contest 106125), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Delft Algorithm Programming Contest 2025 (DAPC 2025)

Special | 12 problems | 12/12 verified | Difficulty - | 10m 56s

# Problem Rating Tags Accepted Time ✓
A Alto Adaptation 46s ✓
B Bottle of New Port 57s ✓
C Calculation Obfuscation 1m 9s ✓
D Dralinpome 52s ✓
E Entropy Evasion 1m 16s ✓
F Friendly Formation 49s ✓
G Genealogy Gumbo 49s ✓
H Hidden Sequence 50s ✓
I Ingredient Intervals 56s ✓
J Journal Publication 1m 2s ✓
K Koehandel 41s ✓
L Landgrave 49s ✓
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125G - Genealogy Gumbo

We are given a collection of parent-child relations written in the form “A, son of B”. Each statement says that person A has a single known father B.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125A - Alto Adaptation

We are given a sequence of musical notes, each represented as an integer pitch. We are also given a fixed vocal range, defined by an inclusive interval from ℓ to h.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125K - Koehandel

Two players are about to perform a single exchange based on sealed bids. One player, Old MacDonald, has already hidden a number of coins in a cup, and you know exactly how many coins that is, call it $c$. You also have $n$ coins available.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125D - Dralinpome

We are given a single lowercase string and asked to decide whether its letters can be rearranged to form a palindrome. The task is not to construct the palindrome, only to determine whether such a rearrangement exists.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125L - Landgrave

We are given a set of points in the plane, each representing a tower placed at distinct coordinates. The task is to select some of these towers and connect them in a cycle so that they form a simple polygon, and this polygon must satisfy a geometric constraint: every interior…
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125J - Journal Publication

We are given a fixed sequence of authors, and each author comes with up to ten possible strings, each string being one part of their full name. We must choose exactly one string per author.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125I - Ingredient Intervals

We are given a list of ingredients that appear on a product label. Some ingredients have a known percentage, and others are left unspecified.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125H - Hidden Sequence

We are given three strings consisting of the characters 1, 2, and 3. The hidden object is the real sequence of game winners. If player 1 wins a game, then players 2 and 3 write down 1, but player 1 forgets to record that game.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125E - Entropy Evasion

We are given a binary array of length $n le 1000$, initially all zeros. We do not directly set bits. Instead, we repeatedly choose a contiguous segment $[l, r]$, and the system “exposes” that segment to randomness, replacing every bit inside it with an independent fair coin…
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125F - Friendly Formation

We are given a group of $n$ players and a list of pairs of players who already know each other. The task is to divide all players into exactly two teams of equal size, and the constraint is that within each team every pair of players must already know each other.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125C - Calculation Obfuscation

We are given a multiset of characters that originally formed a valid arithmetic expression, but all characters have been shuffled. Our task is to decide whether we can rearrange these characters into a syntactically valid expression, and if yes, output one such expression.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Delft Algorithm Programming Contest 2025 (DAPC 2025) ›

CF 106125B - Bottle of New Port

We are given a bottle that initially contains two kinds of liquid: alcohol and everything else. Over time, both parts evaporate, but at different constant rates per day.
codeforces competitive-programming Jun 19, 2026