Kotlin Heroes: Episode 1

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

9 items

Kotlin Heroes: Episode 1

Kotlin | 9 problems | 4/9 verified | Difficulty - | 17m 12s

# Problem Rating Tags Accepted Time ✓
A Three Integers Again *special, math 1,563 1m 40s
B Bad Days *special, implementation 1,149 3m 12s ✓
C Minus and Minus Give Plus *special, implementation, strings 834 2m 39s
D Decoding of Integer Sequences *special, data-structures, implementation 531 1m 22s
E Sliding Doors *special, binary-search 274 1m 33s ✓
F Wheels *special, binary-search, greedy 135 1m 34s ✓
G Graph Decomposition *special, graphs 84 1m 41s
H Longest Saw *special, constructive-algorithms 57 1m 35s
I Good Subsets *special, dp 47 1m 56s ✓
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170H - Longest Saw

We are given a multiset of integers for each test case. From this multiset, we are allowed to pick any subset of elements and then permute them freely.
codeforces competitive-programming *special constructive-algorithms Jun 18, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170E - Sliding Doors

We are given a line of $m$ cells and a sequence of $n$ sliding doors. Each door occupies a contiguous block of cells, and the doors appear in a fixed left-to-right order.
codeforces competitive-programming *special binary-search Jun 18, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170G - Graph Decomposition

We are given an undirected multigraph where edges may repeat and self-loops are allowed. The task is to completely eliminate all edges by repeatedly choosing a simple cycle and removing all edges belonging to that cycle.
codeforces competitive-programming *special graphs Jun 18, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170F - Wheels

We are given an array of wheel pressures and we need to pick exactly $m$ of them. After selecting those $m$ wheels, we are allowed to change their pressures so that all of them end up equal to a single value.
codeforces competitive-programming *special binary-search greedy Jun 18, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170D - Decoding of Integer Sequences

We are given a single flattened sequence that was produced from several hidden integer sequences. The encoding process mixed all sequences together in “column order”: first all first elements of each sequence, then all second elements, then all third elements, and so on.
codeforces competitive-programming *special data-structures implementation Jun 18, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170C - Minus and Minus Give Plus

We are given two strings consisting only of two symbols, a “minus” and a “plus”. The only allowed move takes two neighboring minus signs and replaces them with a single plus sign, which shortens the string by one character.
codeforces competitive-programming *special implementation strings Jun 18, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 1 ›

CF 1170A - Three Integers Again

We are given two numbers per query, and each query hides a simple structure built from three unknown positive integers $a$, $b$, and $c$. From these three values we can form three pairwise sums: $a+b$, $a+c$, and $b+c$.
codeforces competitive-programming *special math Jun 18, 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