Codeforces Round 187 (Div. 1)

Solutions for Codeforces Round 187 (Div. 1) (contest 314). 2/3 problems verified against sample I/O. Difficulty range: 2000-2900.

3 items

Codeforces Round 187 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 2/3 | Rating range: 2000-2900 | Time: 6m 22s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Sereja and Periods	2000	binary-search, dfs-and-similar, strings	1m 23s	✓
D	Sereja and Straight Lines	2500	binary-search, data-structures, geometry	1m 45s	✓
E	Sereja and Squares	2900	dp	3m 14s	✗

Practice › Codeforces Solutions › Codeforces Round 187 (Div. 1) ›

CF 314B - Sereja and Periods

We are given two base strings, call them a and c, and two integers b and d. From these, two longer strings are conceptually constructed: the first string is a repeated b times, and the second is c repeated p times for some unknown positive integer p.

Practice › Codeforces Solutions › Codeforces Round 187 (Div. 1) ›

CF 314D - Sereja and Straight Lines

We are given a set of points in the plane, and we want to place two infinite straight lines that must always be perpendicular to each other. One of these lines is constrained in orientation: it must make a 45-degree angle with the positive x-axis.

Practice › Codeforces Solutions › Codeforces Round 187 (Div. 1) ›

CF 314E - Sereja and Squares

We are given a line of points fixed at coordinates $(1,0), (2,0), dots, (n,0)$. Each point initially has a lowercase letter label, except that some of these labels were erased and replaced with question marks. All uppercase letters were also erased.