Codeforces Round 238 (Div. 2)

Solutions for Codeforces Round 238 (Div. 2) (contest 405). 0/4 problems verified against sample I/O. Difficulty range: 900-2300.

4 items

Codeforces Round 238 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 900-2300 | Time: 15m 46s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Gravity Flip	900	greedy, implementation, sortings	6m 21s	✗
B	Domino Effect	1100	-	1m 23s	✗
C	Unusual Product	1600	implementation, math	1m 27s	✗
E	Graph Cutting	2300	dfs-and-similar, graphs	6m 35s	✗

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

CF 405A - Gravity Flip

We are given a row of vertical stacks of cubes, where each position holds a certain number of cubes. You can think of this as an array where each index represents a column and the value is its height.

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

CF 405B - Domino Effect

Codeforces 405B: Domino Effect

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

CF 405C - Unusual Product

Codeforces 405C: Unusual Product

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

CF 405E - Graph Cutting

We are given a connected undirected simple graph and we need to break its edge set into groups of three vertices, where each group forms a path of length two.