TheForces Round #16 (2^4-Forces)

5 problems from TheForces Round #16 (2^4-Forces) (contest 104420), difficulty -. 1/5 solutions verified against sample I/O.

5 items

TheForces Round #16 (2^4-Forces)

Special | 5 problems | 1/5 verified | Difficulty - | 7m 21s

#	Problem	Time	✓
A	Infinite Grid	1m 5s	✓
B	Mex Path	1m 29s
C	Get the Long Binary Number	1m 37s
D	Increasing A and Decreasing B	1m 45s
E	Grid Walking+	1m 25s

Practice › Codeforces Solutions › TheForces Round #16 (2^4-Forces) ›

CF 104420E - Grid Walking+

We are working on a grid where every cell contains a value. A player moves through this grid and “collects” values from cells they visit. Movement is restricted: from any cell, you may move right, left, or down, but never up.

Practice › Codeforces Solutions › TheForces Round #16 (2^4-Forces) ›

CF 104420D - Increasing A and Decreasing B

We are asked to construct an integer sequence that starts from a fixed value and grows strictly. The twist is not in the growth itself, but in how the differences between consecutive elements behave under XOR.

Practice › Codeforces Solutions › TheForces Round #16 (2^4-Forces) ›

CF 104420C - Get the Long Binary Number

We are given a binary string $y$ and an integer $k$. We need to construct another binary string $x$ such that two conditions are satisfied simultaneously. First, $x$ must represent a binary number that is not smaller than $y$.

Practice › Codeforces Solutions › TheForces Round #16 (2^4-Forces) ›

CF 104420B - Mex Path

We are given a grid with exactly two rows and n columns. Each cell contains a non-negative integer. We must construct a walk that starts at the top-left cell (1,1) and ends at the bottom-right cell (2,n).

Practice › Codeforces Solutions › TheForces Round #16 (2^4-Forces) ›

CF 104420A - Infinite Grid

We are working on an infinite square grid where every cell starts out white. We then choose exactly n cells and repaint them red. The grid is considered as a graph where each cell connects to its four neighbors by unit edges.