Codeforces Round 238 (Div. 1)

2 problems from Codeforces Round 238 (Div. 1) (contest 406), difficulty 2200-2800. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 238 (Div. 1)

Div. 1 | 2 problems | 0/2 verified | Difficulty 2200-2800 | 6m 36s

# Problem Rating Tags Accepted Time ✓
D Hill Climbing 2200 dfs-and-similar, geometry, trees 1,281 2m 13s
E Hamming Triples 2800 implementation, math, two-pointers 272 4m 23s
Practice › Codeforces Solutions › Codeforces Round 238 (Div. 1) ›

CF 406D - Hill Climbing

We are given a sequence of hills placed along a line. Each hill has a fixed horizontal position and a height, and we imagine it as a vertical segment rising from the ground.
codeforces competitive-programming dfs-and-similar geometry trees May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 238 (Div. 1) ›

CF 406E - Hamming Triples

The problem presents a collection of binary strings of a fixed length, but rather than giving the strings explicitly, each string is described compactly: the first $fi$ bits are the same, $si$, and the remaining $n-fi$ bits are the opposite of $si$.
codeforces competitive-programming implementation math two-pointers May 29, 2026