TheForces Round #30 (Good-Forces)

7 problems from TheForces Round #30 (Good-Forces) (contest 105137), difficulty -. 0/7 solutions verified against sample I/O.

7 items

TheForces Round #30 (Good-Forces)

Special | 7 problems | 0/7 verified | Difficulty - | 8m

#	Problem	Time
A	Good Target	1m 11s
B	Good String	1m 13s
C	Good Permutation	2m 47s
D	Good String Again	1m 26s
E	Good Game	29s
F	Good Tree Queries	26s
G	Good but not Excellent	28s

Practice › Codeforces Solutions › TheForces Round #30 (Good-Forces) ›

CF 105137C - Good Permutation

We are asked to construct a permutation of the numbers from 1 to n such that a particular cost expression becomes as small as possible.

Practice › Codeforces Solutions › TheForces Round #30 (Good-Forces) ›

CF 105137G - Good but not Excellent

Working

Practice › Codeforces Solutions › TheForces Round #30 (Good-Forces) ›

CF 105137D - Good String Again

We are dealing with a hidden binary string of length n. We cannot see it directly. Instead, we are allowed to submit a constructed binary string T of the same length, and the judge returns a single number: the count of positions where S XOR T equals zero.

Practice › Codeforces Solutions › TheForces Round #30 (Good-Forces) ›

CF 105137F - Good Tree Queries

Working

Practice › Codeforces Solutions › TheForces Round #30 (Good-Forces) ›

CF 105137E - Good Game

The structure is a rooted tree with node 1 acting as the root, but conceptually it is drawn upside down so that gravity pushes objects toward the root. Each node can hold at most one ball. We are given a sequence of starting nodes, and we drop balls one by one.

Practice › Codeforces Solutions › TheForces Round #30 (Good-Forces) ›

CF 105137B - Good String

We are given a binary string and two ways to modify it, each with a cost. The goal is to transform the string into a “good” form where no adjacent pair of characters differs.

Practice › Codeforces Solutions › TheForces Round #30 (Good-Forces) ›

CF 105137A - Good Target

We are simulating a simplified cricket scoring system where each ball contributes a fixed amount of runs. The batsman can only score either 4 or 6 runs per ball, and we want to reach at least a target score $n$.