Kotlin Heroes: Episode 1

8 problems from Kotlin Heroes: Episode 1 (contest 1170), difficulty -. 2/8 solutions verified against sample I/O.

8 items

Kotlin Heroes: Episode 1

Kotlin | 8 problems | 2/8 verified | Difficulty - | 41m 29s

# Problem Rating Tags Accepted Time ✓
A Three Integers Again *special, math 1,563 4m 16s
B Bad Days *special, implementation 1,149 3m 12s ✓
C Minus and Minus Give Plus *special, implementation, strings 834 7m 9s
D Decoding of Integer Sequences *special, data-structures, implementation 531 8m 14s
F Wheels *special, binary-search, greedy 135 6m 6s
G Graph Decomposition *special, graphs 84 4m 48s
H Longest Saw *special, constructive-algorithms 57 5m 48s
I Good Subsets *special, dp 47 1m 56s ✓
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170F - Wheels

We are given a collection of wheel pressures, and we must choose exactly m of them. After choosing the subset, we are allowed to change pressures by spending time: each unit of time changes one wheel pressure by 1 up or down.
codeforces competitive-programming *special binary-search greedy Jun 15, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170H - Longest Saw

We are allowed to take any subset of the given multiset and then freely permute it. The goal is to arrange the chosen numbers into a sequence where comparisons alternate strictly: either high-low-high-low or low-high-low-high.
codeforces competitive-programming *special constructive-algorithms Jun 15, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170G - Graph Decomposition

We are given an undirected graph that may contain parallel edges and self-loops, and we are allowed to repeatedly remove edge-disjoint simple cycles.
codeforces competitive-programming *special graphs Jun 15, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170D - Decoding of Integer Sequences

We are given a single long sequence that was produced by interleaving several hidden integer sequences in a very specific structured way. Each original sequence contains non-negative integers and was extended with a terminal marker -1.
codeforces competitive-programming *special data-structures implementation Jun 15, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170C - Minus and Minus Give Plus

We are given a string made only of two symbols, plus and minus. We are allowed to repeatedly pick any two adjacent minus signs and replace them with a single plus sign. This operation shortens the string by one character, since two symbols are replaced by one.
codeforces competitive-programming *special implementation strings Jun 15, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170A - Three Integers Again

We are given two numbers that are known to be two of the three pairwise sums formed from some unknown positive integers $a$, $b$, and $c$. The missing third sum is not provided, and we do not know which pair each given value corresponds to.
codeforces competitive-programming *special math Jun 13, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170I - Good Subsets

We are given a set of segments on the real line, each defined by its left and right endpoints. The task is to count subsets of these segments whose union exactly equals the union of all segments.
codeforces competitive-programming *special dp Jun 12, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170B - Bad Days

We are given a sequence of daily website visit counts. Each position represents one day, and the value at that position represents how many visits occurred on that day. We need to examine every day and decide whether it is “bad”.
codeforces competitive-programming *special implementation Jun 12, 2026