Kotlin Heroes: Episode 3

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

9 items

Kotlin Heroes: Episode 3

Kotlin | 9 problems | 1/9 verified | Difficulty - | 32m 16s

#	Problem	Tags	Accepted	Time	✓
A	Likes Display	*special, implementation	958	1m 57s	✓
B	Cartoons	*special, implementation, sortings	433	3m 5s
C	Dream Team	*special, greedy	414	3m 24s
D	Bonus Distribution	*special, binary-search, greedy	274	3m 37s
E	Modernization of Treeland	*special, dfs-and-similar, trees	218	3m 35s
F	Movie Fan	*special, data-structures, greedy	127	2m 18s
G	M-numbers	*special, dp, math	78	5m 1s
H	Paint the String	*special, dp, strings	53	5m 33s
I	Falling Blocks	*special, data-structures	37	3m 46s

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297I - Falling Blocks

We are given a sequence of horizontal segments that arrive one after another on a 1D board of length $d$. Each segment represents a block that falls vertically until it either touches the ground or touches the top of some previously placed block.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297H - Paint the String

We are given a string and must assign each character to one of two groups, which we can think of as placing each character into either a red bucket or a blue bucket while preserving their original order inside each bucket.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297G - M-numbers

We are given a target value $m$ and asked to consider all positive integers whose digits multiply exactly to $m$. These integers form an infinite set in general, and we are asked to sort this set in increasing numerical order and return the $k$-th element.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297F - Movie Fan

We are given several movies, each movie has a time window during which it can be watched in the cinema. If a movie is watched inside its window, it is considered “on time”.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297D - Bonus Distribution

Each employee has a fixed base salary, and we are allowed to distribute an additional integer bonus so that the total bonus across all employees is exactly k. After adding bonuses, each employee’s final salary becomes their original salary plus their assigned bonus.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297E - Modernization of Treeland

We are given a tree of cities. From this tree we must choose a subset of cities $S$ such that two conditions hold simultaneously.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297C - Dream Team

We are given an array of integers for each test case, where each value represents the contribution of a developer. We want to pick a subset of indices to form a team, and the value of the team is simply the sum of the chosen elements.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297B - Cartoons

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…

Practice › Codeforces Solutions › Kotlin Heroes: Episode 3 ›

CF 1297A - Likes Display

The task is to convert a raw number of likes into a compact, human-readable format for display. Numbers less than a thousand remain as-is, numbers in the thousands are rounded to the nearest thousand with a 'K' suffix, and numbers in the millions are rounded to the nearest…