TheForces Round #23 (Balanced-Forces)

5 problems from TheForces Round #23 (Balanced-Forces) (contest 104570), difficulty -. 0/5 solutions verified against sample I/O.

5 items

TheForces Round #23 (Balanced-Forces)

Special | 5 problems | 0/5 verified | Difficulty - | 8m 1s

#	Problem	Time
A	Coins	1m 14s
B	Two Arrays Game	1m 30s
C	Super Palindrome	2m 20s
D	Balanced Permutation	1m 19s
F	Random Noise	1m 38s

Practice › Codeforces Solutions › TheForces Round #23 (Balanced-Forces) ›

CF 104570F - Random Noise

We are working with an array of 20-bit integers that changes over time through point updates, range operations, and probabilistic bit flips.

Practice › Codeforces Solutions › TheForces Round #23 (Balanced-Forces) ›

CF 104570D - Balanced Permutation

We are asked to construct a permutation of the numbers from 1 to n such that there exists a split point where the sum of the prefix equals the sum of the suffix. Among all such valid permutations, we must output the one that is lexicographically smallest.

Practice › Codeforces Solutions › TheForces Round #23 (Balanced-Forces) ›

CF 104570C - Super Palindrome

We are given a binary string and asked to count how many of its contiguous substrings satisfy a fairly strict structural property. A substring is considered valid if it is a palindrome, and if we remove its last character, the remaining prefix is still a palindrome.

Practice › Codeforces Solutions › TheForces Round #23 (Balanced-Forces) ›

CF 104570B - Two Arrays Game

We are given two arrays of the same length, and both players ultimately interact with a shared “board” formed from those arrays. Each position holds a number, and once a number is taken it becomes zero and cannot be used again.

Practice › Codeforces Solutions › TheForces Round #23 (Balanced-Forces) ›

CF 104570A - Coins

We are given a small “currency system” consisting of three coin types: coins worth 1, coins worth 10, and coins worth 100.