Codeforces Round 144 (Div. 1)

5 problems from Codeforces Round 144 (Div. 1) (contest 232), difficulty 1600-3000. 1/5 solutions verified against sample I/O.

5 items

Codeforces Round 144 (Div. 1)

Div. 1 | 5 problems | 1/5 verified | Difficulty 1600-3000 | 18m 29s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Cycles	1600	binary-search, constructive-algorithms, graphs	2,841	1m 44s	✓
B	Table	1900	bitmasks, combinatorics, dp	1,678	5m 17s
C	Doe Graphs	2600	constructive-algorithms, divide-and-conquer, dp	309	2m 17s
D	Fence	2900	binary-search, data-structures, string-suffix-structures	523	6m 50s
E	Quick Tortoise	3000	bitmasks, divide-and-conquer, dp	885	2m 21s

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

CF 232C - Doe Graphs

We are asked to compute shortest paths in a family of recursively defined graphs called Doe graphs. Each graph is defined by an order n. The base cases are trivial: D(0) is a single vertex and D(1) is two vertices connected by one edge.

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

CF 232A - Cycles

We are asked to construct an undirected graph with exactly k triangles, where a triangle is a set of three vertices all connected pairwise.

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

CF 232E - Quick Tortoise

Codeforces 232E: Quick Tortoise

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

CF 232D - Fence

We have an array of plank heights. A fence piece is simply a contiguous segment. For a query segment $[l,r]$, we must count how many other segments of the same length match it. Matching has three requirements. The two segments must have equal length. They must be disjoint.

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

CF 232B - Table

Codeforces 232B: Table