Codeforces Round 238 (Div. 2)

5 problems from Codeforces Round 238 (Div. 2) (contest 405), difficulty 900-2300. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 238 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 900-2300 | 22m 48s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Gravity Flip	900	greedy, implementation, sortings	126,418	4m 16s	✓
B	Domino Effect	1100		6,107	4m 21s	✓
C	Unusual Product	1600	implementation, math	4,931	4m 31s	✓
D	Toy Sum	1700	greedy, implementation, math	3,287	4m 56s
E	Graph Cutting	2300	dfs-and-similar, graphs	1,602	4m 44s

Practice › Codeforces Solutions › Codeforces Round 238 (Div. 2) ›

CF 405D - Toy Sum

We are given a large universe of numbered blocks from 1 to 1,000,000. Some subset of these blocks, called $X$, has been removed from Chris’s set. From the remaining blocks, we need to choose a non-empty subset $Y$ so that a very specific weighted balance condition holds.

Practice › Codeforces Solutions › Codeforces Round 238 (Div. 2) ›

CF 405E - Graph Cutting

We are given a connected undirected graph, and we are asked to completely decompose its edges into length-2 paths.

Practice › Codeforces Solutions › Codeforces Round 238 (Div. 2) ›

CF 405C - Unusual Product

We are given an n×n binary matrix, meaning every element is either 0 or 1. The "unusual square" of the matrix is defined as the sum over all rows of the dot product of row i with column i, computed modulo 2.

Practice › Codeforces Solutions › Codeforces Round 238 (Div. 2) ›

CF 405B - Domino Effect

We are given a row of dominoes, some of which are initially pushed to fall either left or right, while others are standing upright. Each second, a falling domino pushes its immediate neighbor in the same direction.

Practice › Codeforces Solutions › Codeforces Round 238 (Div. 2) ›

CF 405A - Gravity Flip

We are given a row of vertical stacks of cubes. Each position in the row holds a column, and the input array describes how many cubes are stacked at each position. Then a “gravity switch” happens.