Kotlin Heroes 5: ICPC Round

Solutions for Kotlin Heroes 5: ICPC Round (contest 1431). 4/10 problems verified against sample I/O. Difficulty range: 800-3400.

10 items

Kotlin Heroes 5: ICPC Round

Type: Kotlin | Problems: 10 | Verified: 4/10 | Rating range: 800-3400 | Time: 27m 39s

Problem Name Rating Tags Solve Time Verified
A Selling Hamburgers 800 *special 1m 17s ✓
B Polycarp and the Language of Gods 1400 *special, implementation, two-pointers 1m 34s ✓
C Black Friday 1600 *special, implementation 2m 56s ✗
D Used Markers 1500 *special, greedy 9m 42s ✗
E Chess Match 2000 *special 1m 39s ✗
F Neural Network Problem 2100 *special, binary-search, greedy 3m ✗
G Number Deletion Game 2100 *special, dp, games 1m 23s ✓
H Rogue-like Game 2600 *special, brute-force, greedy 2m 3s ✗
I Cyclic Shifts 2900 *special, strings 2m 42s ✗
J Zero-XOR Array 3400 *special, dp 1m 23s ✓
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431D - Used Markers

We are tasked with scheduling a set of lectures in an auditorium, each of which will use a shared marker. Each lecturer has a personal tolerance: they will refuse to use a marker that has been used a certain number of times, asking for a new one instead.
codeforces competitive-programming *special greedy Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431I - Cyclic Shifts

Codeforces 1431I: Cyclic Shifts
codeforces competitive-programming *special strings Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431J - Zero-XOR Array

We are given a sorted array a of length n. Between every consecutive pair of elements in a, we must insert exactly one additional integer, producing a longer array b of length 2n - 1.
codeforces competitive-programming *special dp Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431H - Rogue-like Game

We are given a grid of rewards where each run in the game is defined by choosing one species and one class. Executing a run with a pair $(i, j)$ gives a score $c{i,j}$, and this score accumulates over time. At the beginning, only some species and classes are already available.
codeforces competitive-programming *special brute-force greedy two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431F - Neural Network Problem

The key issue is that this is a constructive problem. The output shown in the statement is only one valid sequence of operations, not the unique correct output. Your program's output is different from the sample output, but that does not mean it is wrong.
codeforces competitive-programming *special binary-search greedy Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431G - Number Deletion Game

We are given a collection of distinct integers. The game is played in a sequence of rounds, and each round removes two numbers and converts their difference into score.
codeforces competitive-programming *special dp games greedy Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431E - Chess Match

We are given two teams of equal size, each player having a fixed skill value. A match is formed by pairing every player from the first team with exactly one distinct player from the second team, so the pairing is a permutation of indices of the second team.
codeforces competitive-programming *special Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431C - Black Friday

The key issue is that this is a constructive problem. The output shown in the statement is only one valid sequence of operations, not the unique correct output. Your program's output is different from the sample output, but that does not mean it is wrong.
codeforces competitive-programming *special implementation Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431B - Polycarp and the Language of Gods

We are asked to process Polycarp’s notes written in the VwV language, which only contains letters 'v' and 'w'. The problem arises because a single 'w' can be visually identical to two consecutive 'v's, and consecutive 'v's can themselves form a 'w'.
codeforces competitive-programming *special implementation two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Kotlin Heroes 5: ICPC Round ›

CF 1431A - Selling Hamburgers

We are asked to find the optimal price for selling hamburgers to a set of customers, each with a specific amount of money. Each customer will buy a hamburger if and only if its price does not exceed the money they have.
codeforces competitive-programming *special Jun 11, 2026