Kotlin Heroes: Episode 4

6 problems from Kotlin Heroes: Episode 4 (contest 1346), difficulty 1000-2900. 2/6 solutions verified against sample I/O.

6 items

Kotlin Heroes: Episode 4

Kotlin | 6 problems | 2/6 verified | Difficulty 1000-2900 | 28m 35s

# Problem Rating Tags Accepted Time ✓
A Color Revolution 1000 *special, math 2,202 11m 53s ✓
B Boot Camp 1400 *special, greedy 1,252 3m 10s
C Spring Cleaning 1600 *special, greedy, sortings 677 5m 16s
D Constructing the Dungeon 1600 *special, graphs, greedy 544 2m 56s ✓
G Two IP Cameras 2300 *special, math, number-theory 150 1m 20s
I Pac-Man 2.0 2900 *special, dp 54 4m
Practice › Codeforces Solutions › Kotlin Heroes: Episode 4 ›

CF 1346I - Pac-Man 2.0

The game world is a directed graph with up to 15 locations, each location containing a fixed number of pellets. From any location you can reach any other, so the graph is strongly connected.
codeforces competitive-programming *special dp Jun 16, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 4 ›

CF 1346C - Spring Cleaning

We are given a row of shelves, each holding some number of books. The goal is to reach a state where every shelf has at most k books. We are allowed to modify the configuration using two operations.
codeforces competitive-programming *special greedy sortings Jun 16, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 4 ›

CF 1346D - Constructing the Dungeon

We are given an undirected connected graph where vertices represent rooms and edges represent tunnels. Each tunnel already has a fixed value, and we must assign a value to every room.
codeforces competitive-programming *special graphs greedy Jun 16, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 4 ›

CF 1346A - Color Revolution

We are given a total number of participants and a fixed multiplier. The participants must be split into four consecutive groups where each next group is exactly $k$ times larger than the previous one.
codeforces competitive-programming *special math Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 4 ›

CF 1346G - Two IP Cameras

We are given two identical IP cameras, each capable of taking photos at a fixed period. The period of each camera must be chosen from a predefined set of integers, but the starting moment of each camera is flexible.
codeforces competitive-programming *special math number-theory Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 4 ›

CF 1346B - Boot Camp

The problem asks us to schedule the maximum number of lectures during a programming boot camp that lasts n days. Each day is either a normal day, where we can hold lectures, or an excursion day, where no lectures are allowed.
codeforces competitive-programming *special greedy Jun 11, 2026