Codeforces Round 238 (Div. 1)

Solutions for Codeforces Round 238 (Div. 1) (contest 406). 0/2 problems verified against sample I/O. Difficulty range: 2200-2800.

2 items

Codeforces Round 238 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 0/2 | Rating range: 2200-2800 | Time: 6m 36s

Problem Name Rating Tags Solve Time Verified
D Hill Climbing 2200 dfs-and-similar, geometry, trees 2m 13s ✗
E Hamming Triples 2800 implementation, math, two-pointers 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