Codeforces Round 242 (Div. 2)

Solutions for Codeforces Round 242 (Div. 2) (contest 424). 0/5 problems verified against sample I/O. Difficulty range: 900-2500.

5 items

Codeforces Round 242 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 0/5 | Rating range: 900-2500 | Time: 20m 42s

Problem Name Rating Tags Solve Time Verified
A Squats 900 implementation 57s ✗
B Megacity 1200 binary-search, greedy, implementation 5m 55s ✗
C Magic Formulas 1600 math 6m ✗
D Biathlon Track 2300 binary-search, brute-force, constructive-algorithms 1m 21s ✗
E Colored Jenga 2500 dfs-and-similar, dp, probabilities 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.
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 242 (Div. 2) ›

CF 424B - Megacity

Codeforces 424B: Megacity
codeforces competitive-programming binary-search greedy implementation sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 242 (Div. 2) ›

CF 424C - Magic Formulas

Codeforces 424C: Magic Formulas
codeforces competitive-programming math May 29, 2026
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.
codeforces competitive-programming binary-search brute-force constructive-algorithms data-structures dp May 29, 2026
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.
codeforces competitive-programming dfs-and-similar dp probabilities May 29, 2026