Codeforces Round 242 (Div. 2)

5 problems from Codeforces Round 242 (Div. 2) (contest 424), difficulty 900-2500. 0/5 solutions verified against sample I/O.

5 items

Codeforces Round 242 (Div. 2)

Div. 2 | 5 problems | 0/5 verified | Difficulty 900-2500 | 20m 42s

#	Problem	Rating	Tags	Accepted	Time
A	Squats	900	implementation	9,183	57s
B	Megacity	1200	binary-search, greedy, implementation	8,466	5m 55s
C	Magic Formulas	1600	math	5,950	6m
D	Biathlon Track	2300	binary-search, brute-force, constructive-algorithms	610	1m 21s
E	Colored Jenga	2500	dfs-and-similar, dp, probabilities	149	6m 29s

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

CF 424A - Squats

We are given a row on size, showing the algorithm handles boundary constraints uniformly.

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

CF 424B - Megacity

Codeforces 424B: Megacity

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

CF 424C - Magic Formulas

Codeforces 424C: Magic Formulas

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

CF 424D - Biathlon Track

We are given a rectangular grid where each cell has a height. A biathlon track must be the boundary of a sub-rectangle, and athletes run clockwise along this boundary.

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

CF 424E - Colored Jenga

We are given a vertical stack of levels, each level containing three colored blocks arranged left, middle, right.