2024 KAIST 14th ICPC Mock Competition

13 problems from 2024 KAIST 14th ICPC Mock Competition (contest 105401), difficulty -. 1/13 solutions verified against sample I/O.

13 items

2024 KAIST 14th ICPC Mock Competition

ICPC/IOI | 13 problems | 1/13 verified | Difficulty - | 22m 40s

# Problem Rating Tags Accepted Time ✓
A Automata Embedding 2m 17s
B Construct a Coin Set 1m 34s
C Counting Regions 2m 14s
D Graceful Triangles 1m 42s ✓
E Hexagonal Tiling 1m 41s
F Jenga Game 1m 57s
G Make RUN Great Again 1m 32s
H Mosaic 1m 41s
I Mukjjippa 1m 48s
J Running in the Plane 1m 35s
K Same Segment 1m 37s
L Simple Tree Decomposition Problem 1m 32s
M White-Black-Tree 1m 30s
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401M - White-Black-Tree

We are given a tree where every vertex is initially colored either white or black. The tree structure is fixed, but we are allowed to perform operations that swap the colors of two endpoints of any edge, and each such swap costs one unit.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401L - Simple Tree Decomposition Problem

We are given a tree with $N$ vertices. We are allowed to remove any subset of edges. Once those edges are removed, the tree splits into connected components. The requirement is that every resulting connected component must have size either $A$ or $B$.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401J - Running in the Plane

We are given a finite set of integer points in the plane, and we want to construct a small collection of allowed step vectors such that we can build a walk starting from the origin that visits every given point. The walk is a sequence of lattice points starting at $(0,0)$.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401F - Jenga Game

We are given a vertical Jenga tower made of $N$ horizontal layers, each layer having three possible block positions. Each position is either present or missing.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401H - Mosaic

We are given a grid of numbers that is supposed to come from an unknown black and white painting. Each cell of the grid is labeled with how many black cells appear in the 3 by 3 neighborhood centered at that position.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401A - Automata Embedding

We are given a string of length $n$ over an alphabet of size $C$, but instead of working with the string directly, we look at its structure through the KMP prefix-function (failure function).
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401D - Graceful Triangles

We are given a fixed graph structure built from a chain of equilateral triangles. The vertices are laid out in a straight line, labeled from 1 to $n+2$.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401E - Hexagonal Tiling

We are given a regular hexagon of side length $N$, already decomposed into a fixed grid of unit equilateral triangles. The task is to cover the entire region using unit rhombuses, where each rhombus is formed by joining two adjacent unit triangles sharing an edge.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401K - Same Segment

We are given a line of positions from 1 to N, and we must assign each position a value between 0 and K. On top of this array, there are M constraints. Each constraint specifies a segment [l, r] and demands that the sum of values inside that segment is exactly K.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401I - Mukjjippa

We are simulating a probabilistic turn-based game where two players repeatedly play rock-paper-scissors, but the outcome does not immediately determine the winner.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401G - Make RUN Great Again

We have a set of $N$ clubs whose scores are already fixed, and one additional club called RUN whose score we are free to choose at the end.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401C - Counting Regions

We start with an $N times N$ grid where every cell is initially white. The grid is then modified through a fixed sequence of operations, each operation recolors either an entire row or an entire column to black or white.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 KAIST 14th ICPC Mock Competition ›

CF 105401B - Construct a Coin Set

We are asked to construct a set of coin denominations that interact with the greedy change-making strategy in a very specific way. For any amount, the greedy strategy always picks the largest coin not exceeding the remaining sum.
codeforces competitive-programming Jun 23, 2026