Kotlin Heroes: Practice 7

6 problems from Kotlin Heroes: Practice 7 (contest 1532), difficulty -. 3/6 solutions verified against sample I/O.

6 items

Kotlin Heroes: Practice 7

Kotlin | 6 problems | 3/6 verified | Difficulty - | 19m 14s

#	Problem	Tags	Accepted	Time	✓
A	A+B (Trial Problem)	*special	1,150	2m 54s	✓
B	Frog Jumping	*special, math	829	2m 47s	✓
C	Uniform String	*special, implementation	641	4m 20s
D	Teams Forming	*special, sortings	590	1m 21s	✓
E	Good Array	*special	392	3m 28s
F	Prefixes and Suffixes	*special, strings	219	4m 24s

Practice › Codeforces Solutions › Kotlin Heroes: Practice 7 ›

CF 1532F - Prefixes and Suffixes

We are given a multiset of strings that all come from a single unknown string of length $n$. For every length $k$ from $1$ to $n-1$, we are given exactly two strings of that length, and each of those two strings is either a prefix or a suffix of the hidden string.

Practice › Codeforces Solutions › Kotlin Heroes: Practice 7 ›

CF 1532E - Good Array

We are given an array of integers and we are allowed to remove exactly one element at a time. For each removal, we look at the remaining array and ask a very specific question: does there exist an element that is exactly equal to the sum of all the other elements in that…

Practice › Codeforces Solutions › Kotlin Heroes: Practice 7 ›

Kotlin Heroes: Practice 7

Kotlin Heroes: Practice 7

CF 1532F - Prefixes and Suffixes

CF 1532E - Good Array

CF 1532C - Uniform String

CF 1532A - A+B (Trial Problem)

CF 1532B - Frog Jumping

CF 1532D - Teams Forming