2025 Benelux Algorithm Programming Contest (BAPC 25)

12 problems from 2025 Benelux Algorithm Programming Contest (BAPC 25) (contest 106160), difficulty -. 9/12 solutions verified against sample I/O.

12 items

2025 Benelux Algorithm Programming Contest (BAPC 25)

Special | 12 problems | 9/12 verified | Difficulty - | 13m 1s

#	Problem	Time	✓
A	Accidental Arithmetic	1m 35s	✓
B	Boggle Sort	42s	✓
C	Coherency	56s	✓
D	Duo Detection	25s
E	Excruciating Elevators	56s	✓
F	Faulty Connection	5m 16s
G	Garbage In, Garbage Out	28s	✓
H	Homesick	39s	✓
I	Intermill Logistics	27s	✓
J	Jacobi Numbers	29s	✓
K	Knowing the Clock	17s
L	Linguistic Labyrinth	51s	✓

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160F - Faulty Connection

Codeforces 106160F: Faulty Connection

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160L - Linguistic Labyrinth

We have a grid with exactly three rows and W columns. Three cells are special. The first player starts at A = (1, a), the second player starts at B = (3, b), and both want to reach X = (2, 1). Before the game starts, we may place obstacles on any cells except A, B, and X.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160J - Jacobi Numbers

The task asks us to express a positive integer n as a sum of cubes. We must print a list of integers, each between -10000 and 10000, whose cubes add up exactly to n. Any valid decomposition is accepted, and the number of printed terms cannot exceed 10000.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160K - Knowing the Clock

I can't write a correct editorial for Codeforces 106160K - Knowing the Clock because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160H - Homesick

We have two lowercase strings of equal length, S and T. One operation chooses a suffix of S and a value k between 1 and 25. Every character in that suffix is shifted forward by k positions in the alphabet, with wraparound from z back to a.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160I - Intermill Logistics

We have a collection of flour mills. Each mill has two properties: how much wheat it can process per hour and how many hours away it is. Shipping wheat to a mill and bringing the flour back takes twice the given travel time.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160G - Garbage In, Garbage Out

The maze is a grid of cells, and each cell contains a digit describing its radioactivity level. A traveler starts at the top-left cell and wants to reach the bottom cell while moving only between side-adjacent cells.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160E - Excruciating Elevators

Each graph vertex has a unique identifier. One of the vertices has identifier 1. We are allowed to delete edges, but we are not allowed to add edges. After deleting some edges, we look at the connected component containing the vertex whose identifier is 1.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160A - Accidental Arithmetic

We are given a natural number n, but instead of entering it perfectly into a calculator, every digit press can accidentally be followed by a + button press, a - button press, or nothing. The probabilities are fixed: + happens with probability 0.45, - happens with probability 0.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160D - Duo Detection

I can write the editorial, but I need the exact problem statement details first. I found that Codeforces Gym 106160D is “Duo Detection”, where the task is to find two messages sharing at least two symbols, with the total size of all messages bounded by 100000.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160C - Coherency

Each model is represented by a circle on a very large board. The input gives the center coordinates of the circle and its diameter. Two models are considered directly connected when the distance between the edges of their bases is at most two inches.

Practice › Codeforces Solutions › 2025 Benelux Algorithm Programming Contest (BAPC 25) ›

CF 106160B - Boggle Sort

The puzzle is about a 4 by 4 tray of dice. Each die has six possible letters, and we may only rotate a die. The dice stay in their original positions.