Codeforces Round 200 (Div. 1)

Solutions for Codeforces Round 200 (Div. 1) (contest 343). 0/1 problems verified against sample I/O. Difficulty range: 1900-1900.

1 items

Codeforces Round 200 (Div. 1)

Type: Div. 1 | Problems: 1 | Verified: 0/1 | Rating range: 1900-1900 | Time: 16m 21s

Problem Name Rating Tags Solve Time Verified
C Read Time 1900 binary-search, greedy, two-pointers 16m 21s ✗
Practice › Codeforces Solutions › Codeforces Round 200 (Div. 1) ›

CF 343C - Read Time

We have a set of reading heads positioned on an infinitely long tape of tracks. Each head starts at a distinct track, and it can move left, right, or stay put once per second.
codeforces competitive-programming binary-search greedy two-pointers May 29, 2026