Codeforces Round 566 (Div. 2)

Solutions for Codeforces Round 566 (Div. 2) (contest 1182). 3/6 problems verified against sample I/O. Difficulty range: 1000-2700.

6 items

Codeforces Round 566 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 1000-2700 | Time: 28m 58s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Filling Shapes	1000	dp, math	1m 23s	✓
B	Plus from Picture	1300	dfs-and-similar, implementation, strings	11m 19s	✓
C	Beautiful Lyrics	1700	data-structures, greedy, strings	3m 38s	✗
D	Complete Mirror	2400	constructive-algorithms, dfs-and-similar, dp	1m 17s	✓
E	Product Oriented Recurrence	2300	dp, math, matrices	3m 41s	✗
F	Maximum Sine	2700	binary-search, data-structures, number-theory	7m 40s	✗

Practice › Codeforces Solutions › Codeforces Round 566 (Div. 2) ›

CF 1182B - Plus from Picture

We are given a grid of characters representing a picture, where each cell is either empty or filled. The task is to decide whether the filled cells form exactly one plus-shaped figure. A valid plus shape has a single central filled cell.

Practice › Codeforces Solutions › Codeforces Round 566 (Div. 2) ›

CF 1182F - Maximum Sine

We are given a function over integers that depends on a scaled angle of a sine wave. For any integer position $x$, we compute an angle proportional to $x$, specifically $frac{p}{q}pi x$, and evaluate the absolute value of its sine.

Practice › Codeforces Solutions › Codeforces Round 566 (Div. 2) ›

CF 1182E - Product Oriented Recurrence

We are given a sequence defined by a multiplicative recurrence. The first three values are known, and every later value is built from the previous three by multiplying them together and then scaling by a power of a constant.

Practice › Codeforces Solutions › Codeforces Round 566 (Div. 2) ›

CF 1182C - Beautiful Lyrics

We are given a collection of words, and we want to group them into as many valid “lyrics” as possible. Each lyric uses four words arranged as two lines of two words each.

Practice › Codeforces Solutions › Codeforces Round 566 (Div. 2) ›

CF 1182D - Complete Mirror

We are given a tree with $n$ vertices, described by $n-1$ edges. A tree is a connected graph without cycles. The task is to choose a vertex as a root such that all vertices at the same distance from the root have the same degree, where degree counts the number of edges…

Practice › Codeforces Solutions › Codeforces Round 566 (Div. 2) ›

CF 1182A - Filling Shapes

We have a board with 3 rows and $n$ columns. The only pieces available are dominoes of size $2 times 1$, which may be placed either vertically or horizontally.