2025-2026 ICPC German Collegiate Programming Contest (GCPC 2025)
13 problems from 2025-2026 ICPC German Collegiate Programming Contest (GCPC 2025) (contest 106129), difficulty -. 13/13 solutions verified against sample I/O.
2025-2026 ICPC German Collegiate Programming Contest (GCPC 2025)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 13m 16s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Around the Table | 1m 3s | ✓ | |||
| B | Bustling Busride | 1m 3s | ✓ | |||
| C | Congklak | 1m 5s | ✓ | |||
| D | Demand for Cycling | 1m 3s | ✓ | |||
| E | Engineering Excellence | 52s | ✓ | |||
| F | Fair and Square | 55s | ✓ | |||
| G | Generating Cool Passwords Company | 57s | ✓ | |||
| H | Happy Hookup | 42s | ✓ | |||
| I | Island Urbanism | 1m 17s | ✓ | |||
| J | Jumbled Packets | 1m 44s | ✓ | |||
| K | Karlsruhe Skyline | 55s | ✓ | |||
| L | Labour Laws | 49s | ✓ | |||
| M | Mex Hex | 51s | ✓ |
CF 106129K - Karlsruhe Skyline
We are asked to construct a single permutation of the numbers from 1 to n, interpreted as building heights along a row. Two integers a and b describe how many buildings are visible when looking from the left end and from the right end respectively.
CF 106129H - Happy Hookup
We are given a directed graph where vertices represent train stations and edges represent one-way train connections. Two people start from two different stations, and each can travel along directed edges any number of times.
CF 106129D - Demand for Cycling
We are given a simple orthogonal polygon, meaning its boundary is a closed cycle made only of horizontal and vertical segments, with no self-intersections. The vertices are listed in counterclockwise order, so walking through them traces the city boundary.
CF 106129C - Congklak
We are given a row of $n$ holes, each containing some number of stones. The process we simulate is a repeated game played $t$ times. In each game, a single “hand” starts at hole 1 carrying exactly one stone and moves strictly from left to right.
CF 106129L - Labour Laws
We are given a single number that represents the total time an employee was “at work” during a day, measured in minutes. This total includes both actual working time and break time, but the break time was not recorded separately.
CF 106129G - Generating Cool Passwords Company
We need to construct a collection of passwords, with the number of passwords given as $n$, where $n le 1000$. Each password is a string over printable ASCII characters (from code 33 to 126), and each string must have length between 8 and 12 inclusive.
CF 106129M - Mex Hex
We are given a sequence of spell values, each a non-negative integer, and a shield with a very specific usage pattern.
CF 106129J - Jumbled Packets
We are given a system where a sender receives a binary string and must transmit it through a very unreliable channel. The channel does not preserve boundaries of the transmitted packet. Instead, what arrives is a cyclic shift of what was actually sent.
CF 106129I - Island Urbanism
We are given a graph that is physically organized in a very rigid way. The junctions are split into villages, and these villages appear in a fixed circular order.
CF 106129F - Fair and Square
We are given an $h times w$ grid representing a pizza that was originally fully filled with square unit pieces. Some cells are still present, marked as , while others have been eaten, marked as .. We are not allowed to move any remaining pieces, only to partition what remains.
CF 106129E - Engineering Excellence
We are given a simple geometric structure: a convex polygon described by its vertices in counterclockwise order. The polygon is already well-behaved in a strong sense.
CF 106129B - Bustling Busride
We are given a single bus line that starts at the university and goes through a sequence of stops in order until the city. There is a queue of passengers at the university, and each passenger has a fixed destination stop index.
CF 106129A - Around the Table
We are simulating a very structured game involving two queues of players standing on opposite sides of a table. On the left side there are ℓ players arranged in a queue, and on the right side there are r players arranged in another queue.