Codeforces Round 659 (Div. 2)

2 problems from Codeforces Round 659 (Div. 2) (contest 1384), difficulty 1200-2200. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 659 (Div. 2)

Div. 2 | 2 problems | 0/2 verified | Difficulty 1200-2200 | 8m 43s

# Problem Rating Tags Accepted Time ✓
A Common Prefixes 1200 constructive-algorithms, greedy, strings 19,611 2m 5s
B2 Koa and the Beach (Hard Version) 2200 constructive-algorithms, dp, greedy 2,591 6m 38s
Practice › Codeforces Solutions › Codeforces Round 659 (Div. 2) ›

CF 1384B2 - Koa and the Beach (Hard Version)

We are given a one-dimensional path from a shore to an island, where the sea between them is split into $n$ positions. Each position has a base depth $di$. Time progresses in discrete steps, and at each time the water level is uniformly shifted by a periodic tide function.
codeforces competitive-programming constructive-algorithms dp greedy implementation Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 659 (Div. 2) ›

CF 1384A - Common Prefixes

Stopped thinkingDo you like this personality?
codeforces competitive-programming constructive-algorithms greedy strings Jun 16, 2026