Kotlin Heroes: Episode 11

Solutions for Kotlin Heroes: Episode 11 (contest 2011). 2/9 problems verified against sample I/O. Difficulty range: -.

9 items

Kotlin Heroes: Episode 11

Type: Kotlin | Problems: 9 | Verified: 2/9 | Rating range: - | Time: 14m

Problem Name Rating Tags Solve Time Verified
A Problem Solving - *special 1m 48s ✓
B Shuffle - *special 1m 45s ✗
C Split the Expression - *special 2m 37s ✗
D Among Wolves - *special 2m 23s ✗
E Rock-Paper-Scissors Bot - *special, greedy, strings 41s ✗
F Good Subarray - *special, data-structures, greedy 2m 5s ✗
G Removal of a Permutation - *special 43s ✗
H Strange Matrix - *special, graphs, greedy 47s ✗
I Stack and Queue - *special, data-structures, divide-and-conquer 1m 11s ✓
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011I - Stack and Queue

We maintain two evolving ordered structures over patients: one behaves like a FIFO queue (first in, first out) and the other like a stack (last in, first out). Each patient has a fixed service duration.
codeforces competitive-programming *special data-structures divide-and-conquer Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011F - Good Subarray

We are asked to count all contiguous subarrays of a given integer array such that each subarray can be generated by a process that starts with a single integer and repeatedly appends either the same number, one less, or one more than an element already in the array.
codeforces competitive-programming *special data-structures greedy Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011D - Among Wolves

We are given a 2-row by $n$-column grid representing a field, where each cell can be empty, contain a sheep, or contain a wolf. There is exactly one sheep, and some cells contain wolves.
codeforces competitive-programming *special Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011H - Strange Matrix

This is a Type B (proof) problem. The required task is to prove the stated vector identities for: 1. An equilateral triangle. 2. A regular $n$-gon. 3. A regular tetrahedron. A valid solution must establish the identities themselves.
codeforces competitive-programming *special graphs greedy Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011G - Removal of a Permutation

Connection interrupted. Waiting for the complete answer
codeforces competitive-programming *special Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011C - Split the Expression

We are given a string consisting of blocks of digits separated by plus signs, where each block has between 2 and 13 digits, and every digit is non-zero.
codeforces competitive-programming *special Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011E - Rock-Paper-Scissors Bot

Working
codeforces competitive-programming *special greedy strings Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011A - Problem Solving

Jane has a list of problems with known difficulties. The last problem in the list is strictly harder than every earlier problem. Her skill level is some integer $x$.
codeforces competitive-programming *special Jun 8, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 11 ›

CF 2011B - Shuffle

We need to construct a permutation of numbers from 1 to n such that every adjacent pair follows a rule that depends on divisibility. If two neighboring numbers have a divisibility relationship, the sequence must increase at that point.
codeforces competitive-programming *special Jun 8, 2026