Swiss Subregional 2025-2026

11 problems from Swiss Subregional 2025-2026 (contest 106170), difficulty -. 11/11 solutions verified against sample I/O.

11 items

Swiss Subregional 2025-2026

Special | 11 problems | 11/11 verified | Difficulty - | 11m 16s

#	Problem	Time	✓
A	Rainbow	53s	✓
B	Daily Reorganisation	1m 2s	✓
C	The Forgetful Magician	52s	✓
D	Building A Smooth Playlist	1m 2s	✓
E	Counting VIP Guests	40s	✓
F	Random Maze	1m 19s	✓
G	Nearest Strings	56s	✓
H	M\u00f6bius Band Coloring	1m 19s	✓
I	Mancala Solitaire	1m 3s	✓
J	Good Pairs in Graph and Tree	1m 5s	✓
K	Hyperscale AI Data Center	1m 5s	✓

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170D - Building A Smooth Playlist

We are given several independent test cases. Each test case describes a collection of music genres, where the i-th genre contains ci distinct songs.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170J - Good Pairs in Graph and Tree

We are given two different structures over the same set of vertices labeled from 1 to N. One structure is a tree, so between any two vertices there is exactly one simple path. The other structure is an arbitrary undirected simple graph.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170I - Mancala Solitaire

We are asked to construct a starting arrangement of stones in numbered holes 1 through m, with hole 0 being a special sink that starts empty and is not output.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170G - Nearest Strings

We are given several short strings made of lowercase letters, and for each string we want to find another string in the same set that is “closest” under a specific distance measure.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170A - Rainbow

We are given a tree with $n$ vertices. Each edge must be assigned a color from a palette $0$ to $K-1$, where $K$ is not fixed in advance and is part of what we are trying to maximize. Once edges are colored, we look at simple paths in the tree.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170K - Hyperscale AI Data Center

We are given a line of GPUs, each starting with a fixed load. We are allowed to modify each GPU independently by adding an integer adjustment, but each adjustment is capped in magnitude by a common value $k$.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170H - Möbius Band Coloring

We are given a rectangular grid of size $N times M$, where each cell can be painted with one of $K$ colors. The twist is that the rectangle is not used as a flat sheet. One of the lengthwise sides is rotated before gluing, producing a Möbius band.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170F - Random Maze

We are given a rectangular grid of cells. The outer boundary is a solid wall except for two openings: one at the top-left cell and one at the bottom-right cell, which act as the start and end points.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170E - Counting VIP Guests

We are given multiple queries, each describing a continuous segment of house numbers from $A$ to $B$. Every house number has an associated value called its key, defined as the largest odd divisor of that number.

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170B - Daily Reorganisation

We are given a system of locations called hubs. From any hub, a daily move consists of two independent choices: first we leave the current hub using a “departure form” of some methodology, then we enter a destination hub using an “onboarding form” of some (possibly…

Practice › Codeforces Solutions › Swiss Subregional 2025-2026 ›

CF 106170C - The Forgetful Magician

We start with a potion whose initial value is 1. We then apply a sequence of exactly n rune operations, where each operation is either rune A or rune B. Each rune multiplies the current potion value by a fixed integer factor, but those factors are unknown to us.