ETH Zurich Competitive Programming Contest Spring 2024

12 problems from ETH Zurich Competitive Programming Contest Spring 2024 (contest 105167), difficulty -. 1/12 solutions verified against sample I/O.

12 items

ETH Zurich Competitive Programming Contest Spring 2024

Special | 12 problems | 1/12 verified | Difficulty - | 18m 50s

# Problem Rating Tags Accepted Time ✓
A Attending Classes 2m 31s
B Broken Polybahn 1m 2s
C Counting Rectangles 56s ✓
D Dice Game 1m 31s
E Erd\u0151s-Ginzburg-Ziv 2m 44s
F Fraudulent Exam 1m 23s
G Glitchy Language Model 1m 29s
H Hourly Mate 3m 8s
I Increased Intelligence 1m 48s
J Just Too Much Procrastination 17s
K Keen on R\u00f6sti 30s
L Locomotive Control Center 1m 31s
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167L - Locomotive Control Center

We are given a fixed sequence of railcars at station A. Each railcar has a unique label from 1 to n, but they appear in an arbitrary order.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167H - Hourly Mate

We are given a collection of drinks, each drink having a type and an expiration limit measured in hours. Time advances discretely: Sascha consumes exactly one drink per hour, and the machine must choose which drink is dispensed each hour.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167I - Increased Intelligence

We are given a DNA string of length $n$ over the alphabet ${A, C, G, T}$. Inside this string, there is a fixed set of positions that are “editable”, meaning each of those positions can be changed independently into any of the four letters.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167K - Keen on Rösti

We are given a queue of $n$ students arranged in a fixed order, and a probabilistic process that repeatedly acts on the student at the front.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167J - Just Too Much Procrastination

We are given an array of distinct integers, representing heat levels of server racks arranged in a line. We are allowed to rearrange this array using adjacent swaps, where each swap exchanges neighboring elements.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167B - Broken Polybahn

We are given a tree with up to one hundred thousand vertices. From this tree we consider all connected induced substructures formed by choosing some subset of vertices and taking all edges between them that exist in the original tree.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167G - Glitchy Language Model

The input describes a small “language” generated by a large language model. The model defines a finite logic system with a fixed number of truth values from 1 up to S, where S is at most 5.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167E - Erdős-Ginzburg-Ziv

We are given a prime modulus $p$ and a multiset of exactly $p-1$ non-zero residues modulo $p$. These values are not just numbers to use in isolation, they must each be assigned to exactly one edge of a tree with vertices labeled from $0$ to $p-1$.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167F - Fraudulent Exam

We are given a grid of students sitting in an exam hall. Each cell contains a student with a known IQ value. We want to select a group of students such that two conditions are satisfied at the same time. First, the group must be connected in the grid sense.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167A - Attending Classes

The structure is a tree with $n$ locations connected by $n-1$ roads, so between any two places there is exactly one simple path.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167D - Dice Game

We are given several dice, each die currently showing some value from a fixed set of allowed face values. The game lasts for a fixed number of rounds.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › ETH Zurich Competitive Programming Contest Spring 2024 ›

CF 105167C - Counting Rectangles

We are given a grid drawn using horizontal and vertical lines. The grid is fully defined by having $n$ horizontal lines and $m$ vertical lines, evenly spaced in the plane.
codeforces competitive-programming Jun 27, 2026