2025-2026 ICPC Northwestern European Regional Programming Contest (NWERC 2025)
12 problems from 2025-2026 ICPC Northwestern European Regional Programming Contest (NWERC 2025) (contest 106353), difficulty -. 12/12 solutions verified against sample I/O.
2025-2026 ICPC Northwestern European Regional Programming Contest (NWERC 2025)
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 13m 40s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Arcade Crane | 57s | ✓ | |||
| B | Bisecting Bargain | 1m 3s | ✓ | |||
| C | Canal Crossing | 1m 11s | ✓ | |||
| D | Dreamcatcher | 59s | ✓ | |||
| E | Erratic Lights | 48s | ✓ | |||
| F | Fair Share | 1m 3s | ✓ | |||
| G | Group Photo | 57s | ✓ | |||
| H | Hasty Haul | 1m 8s | ✓ | |||
| I | Illuminated Stalls | 52s | ✓ | |||
| J | Juggling Keys | 3m 4s | ✓ | |||
| K | KIT Finding | 46s | ✓ | |||
| L | Last Christmas | 52s | ✓ |
CF 106353I - Illuminated Stalls
We are given a set of axis-aligned line segments, each representing a neon tube. Every segment is either perfectly horizontal or perfectly vertical.
CF 106353K - KIT Finding
We are given a rectangular grid of size $h times w$. Every cell must be filled with one of three letters: ‘K’, ‘I’, or ‘T’. The counts of these letters are fixed in advance, so the grid is essentially a multiset of characters that must be arranged into a matrix.
CF 106353E - Erratic Lights
We are given a string of length $n$, where each position represents a light bulb colored red, green, or blue. The only operation available is to pick a bulb and “touch” it, which immediately resets its color to one of the three colors uniformly at random, independently of…
CF 106353F - Fair Share
A group of people has just finished a shared expense event, and each person has two relevant values. One value represents how much cash they can immediately contribute if someone else is responsible for paying the bill.
CF 106353L - Last Christmas
We are given several ranked Christmas top-10 music charts. Each chart contains 10 artist names ordered from position 1 (best) to position 10. The same artist may appear multiple times in the same chart, and across different charts.
CF 106353J - Juggling Keys
We are given a group of people sharing a flat, and a limited number of physical keys. Over time, each person repeatedly leaves the flat and returns. Every such outing is independent and is described by a single interval: a departure time and a return time.
CF 106353D - Dreamcatcher
We are given a circular structure with $n$ evenly spaced points labeled from 1 to $n$. Starting from point 1, we repeatedly connect each point to the point $k$ steps ahead, wrapping around modulo $n$, until we return to the starting point.
CF 106353A - Arcade Crane
We are given a permutation of numbers from 1 to n placed in a row, and the goal is to transform it into increasing order using a very specific operation.
CF 106353G - Group Photo
We are given a sequence of distinct heights arranged in a line. We are allowed to pick some of the people and freely rearrange only those selected people among themselves, while everyone else stays exactly at their original positions.
CF 106353B - Bisecting Bargain
We are given a target amount of money $n$ in euros, but the way this money is represented is not fixed. An ATM will always hand out some multiset of standard euro denominations whose total value is exactly $n$.
CF 106353H - Hasty Haul
We are given a very small grid, at most 8 by 8, where some cells contain furniture pieces and the rest are empty. Each test case describes one such arrangement with exactly k occupied cells. Two teams agree on a deterministic strategy that looks only at the current arrangement.
CF 106353C - Canal Crossing
We are given a network of places connected by two different kinds of connections. The first kind is a set of normal streets. These streets connect all places, form a tree, and each has a positive travel cost.