TheForces Round #14 (Cool-Forces)

7 problems from TheForces Round #14 (Cool-Forces) (contest 104386), difficulty -. 2/7 solutions verified against sample I/O.

7 items

TheForces Round #14 (Cool-Forces)

Special | 7 problems | 2/7 verified | Difficulty - | 10m 32s

#	Problem	Time	✓
A	Dungeon videogame	1m 18s
B	Random Array	2m 58s	✓
C	Prefix Sum Array	1m 18s
D	Comic Numbers	1m 9s
E	Gridy	1m 3s	✓
F	CLC Loves SQRT Technology (Easy Version)	1m 23s
G	CLC Loves SQRT Technology (Hard Version)	1m 23s

Practice › Codeforces Solutions › TheForces Round #14 (Cool-Forces) ›

CF 104386G - CLC Loves SQRT Technology (Hard Version)

We are given an array and we look at every possible non-empty subsequence of it. For each subsequence, we want to know the minimum number of elements we must overwrite so that the subsequence can be turned into a palindrome.

Practice › Codeforces Solutions › TheForces Round #14 (Cool-Forces) ›

CF 104386F - CLC Loves SQRT Technology (Easy Version)

We are given a sequence of numbers, and we look at every possible non-empty subsequence. For each chosen subsequence, we are allowed to perform an operation where we pick any element in it and overwrite its value arbitrarily.

Practice › Codeforces Solutions › TheForces Round #14 (Cool-Forces) ›

CF 104386B - Random Array

We want the k-th smallest element in a multiset formed by: - X: values xi each repeated si times - Y: values transformed per query as alpha yj + beta, each repeated tj times We never expand arrays. Instead, we answer: how many elements are ≤ v?

Practice › Codeforces Solutions › TheForces Round #14 (Cool-Forces) ›

CF 104386D - Comic Numbers

We are asked to count integers inside many large intervals that satisfy a specific divisibility rule tied to their cube root. For any positive integer $x$, we compute $k = lfloor sqrt[3]{x} rfloor$, and we call $x$ valid if it is divisible by $k$.

Practice › Codeforces Solutions › TheForces Round #14 (Cool-Forces) ›

CF 104386E - Gridy

We are given a rectangular grid where each cell already contains either a fixed 0, a fixed 1, or an unknown ?. Every unknown cell will later be independently replaced by either 0 or 1, each choice having equal probability.

Practice › Codeforces Solutions › TheForces Round #14 (Cool-Forces) ›

CF 104386A - Dungeon videogame

We are given several independent dungeon runs. Each run consists of a sequence of levels, and at each level we must make exactly one choice: either we clear the level and gain the value written on it, or we skip a contiguous block of levels and pay a penalty equal to the…

Practice › Codeforces Solutions › TheForces Round #14 (Cool-Forces) ›

CF 104386C - Prefix Sum Array

We start with an infinite array where every position initially contains the value 1. Each second, the array is replaced by its prefix sum version, meaning the value at position i becomes the sum of all values from position 1 to i in the previous array.