2025-2026 ICPC Nordic Collegiate Programming Contest (NCPC 2025)
11 problems from 2025-2026 ICPC Nordic Collegiate Programming Contest (NCPC 2025) (contest 106124), difficulty -. 11/11 solutions verified against sample I/O.
2025-2026 ICPC Nordic Collegiate Programming Contest (NCPC 2025)
ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 9m 46s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Arithmetic Adaptation | 50s | ✓ | |||
| B | Bohemian Bookshelf | 1m 10s | ✓ | |||
| C | Crochet Competition | 50s | ✓ | |||
| D | Dune Dash | 49s | ✓ | |||
| E | Egyptian Equality | 1m 6s | ✓ | |||
| F | Follower Forensics | 1m 3s | ✓ | |||
| G | Gotta Trade Some of 'Em | 51s | ✓ | |||
| H | Hidden Permutation | 46s | ✓ | |||
| I | Instagraph | 47s | ✓ | |||
| J | Jump | 53s | ✓ | |||
| K | km/h | 41s | ✓ |
CF 106124D - Dune Dash
We are given a set of points in the plane that represent checkpoints of a race route, but the order in which the runner visited them is lost.
CF 106124K - km/h
We are simulating a driver moving through a sequence of road signs, where each sign either sets a specific speed limit or removes the current restriction and restores the original national speed limit.
CF 106124H - Hidden Permutation
We are given a hidden permutation on positions $1 ldots N$. This permutation defines how a binary string of length $N$ is transformed: each step simply reorders the bits according to the permutation.
CF 106124F - Follower Forensics
We are given a set of accounts. Each account already comes with two numbers: how many people it follows, and how many people follow it.
CF 106124A - Arithmetic Adaptation
We are given a single integer s, and we need to split it into two integers a and b such that their sum equals s. Both a and b must be nonzero, and both must lie within the range of three-digit integers, meaning between −999 and 999 inclusive.
CF 106124J - Jump
We are simulating a performer who repeatedly jumps in cycles whose duration depends on his current energy. Each jump lasts exactly $E$ milliseconds at the moment it starts, and the jumps are chained back to back as long as energy remains positive.
CF 106124I - Instagraph
We are given a directed graph where each vertex represents a person and each directed edge represents a “follows” relationship. If there is an edge from $u$ to $v$, then person $u$ follows person $v$.
CF 106124G - Gotta Trade Some of 'Em
We are given a social network of kids, represented as an undirected graph where vertices are kids and edges represent friendships. Each kid must be assigned exactly one game variant from a pool of k possible variants.
CF 106124E - Egyptian Equality
The input describes a triangular “pyramid-shaped” subset of a rectangular grid. Each row is centered inside a fixed-width grid of size $2N-1$, and row $i$ contains exactly $2i-1$ usable cells forming a symmetric triangle.
CF 106124B - Bohemian Bookshelf
We are given a set of books, each book having a spine height and a thickness. We need to place every book into exactly one of two groups: one group is placed upright on the shelf, and the other group is stacked horizontally into a single pile.
CF 106124C - Crochet Competition
We are given two timestamps that describe when a crochet competition started and when it ended. Each timestamp contains a weekday together with a clock time in hours and minutes. The goal is to compute how long the competition lasted, measured in days, hours, and minutes.