Codeforces Round 239 (Div. 1)

Solutions for Codeforces Round 239 (Div. 1) (contest 407). 0/4 problems verified against sample I/O. Difficulty range: 1600-3100.

4 items

Codeforces Round 239 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 0/4 | Rating range: 1600-3100 | Time: 10m 34s

Problem Name Rating Tags Solve Time Verified
B Long Path 1600 dp, implementation 1m 3s ✗
C Curious Array 2500 brute-force, combinatorics, implementation 34s ✗
D Largest Submatrix 3 2700 dp, hashing 4m 21s ✗
E k-d-sequence 3100 data-structures 4m 36s ✗
Practice › Codeforces Solutions › Codeforces Round 239 (Div. 1) ›

CF 407B - Long Path

Codeforces 407B: Long Path
codeforces competitive-programming dp implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 239 (Div. 1) ›

CF 407C - Curious Array

Codeforces 407C: Curious Array
codeforces competitive-programming brute-force combinatorics implementation math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 239 (Div. 1) ›

CF 407D - Largest Submatrix 3

We are given a 2D integer matrix with n rows and m columns. The task is to find a rectangular submatrix where all elements are distinct and whose area (number of elements) is maximized.
codeforces competitive-programming dp hashing May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 239 (Div. 1) ›

CF 407E - k-d-sequence

We are given a sequence of integers, a[1…n], and two parameters k and d. The goal is to find the longest contiguous subsegment of a that can be extended into an arithmetic progression with difference d by adding at most k elements.
codeforces competitive-programming data-structures May 29, 2026