Codeforces Round 652 (Div. 2)

4 problems from Codeforces Round 652 (Div. 2) (contest 1369), difficulty 800-2700. 3/4 solutions verified against sample I/O.

4 items

Codeforces Round 652 (Div. 2)

Div. 2 | 4 problems | 3/4 verified | Difficulty 800-2700 | 17m 38s

#	Problem	Rating	Tags	Accepted	Time	✓
A	FashionabLee	800	geometry, math	39,121	8m 21s	✓
B	AccurateLee	1200	greedy, implementation, strings	25,570	3m 28s	✓
D	TediousLee	1900	dp, graphs, greedy	9,225	2m 30s
F	BareLee	2700	dfs-and-similar, dp, games	716	3m 19s	✓

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

CF 1369F - BareLee

Each round is a two-player deterministic game played on a single integer. A round starts with a value $si$ on a board and a limit $ei$. Players alternate turns, and on each turn the current value $a$ must be replaced by either $a+1$ or $2a$.

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

CF 1369D - TediousLee

The structure in this problem is a very specific rooted tree that grows level by level. Starting from a single node, each level expands every vertex depending on how many children it already has.

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

CF 1369A - FashionabLee

The task asks us to determine whether a given regular polygon can be oriented such that one of its edges is parallel to the horizontal axis and another edge is parallel to the vertical axis simultaneously.

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

CF 1369B - AccurateLee

We are given a binary string and allowed to repeatedly remove characters under a very specific local rule: whenever a 1 appears immediately followed by a 0, we may delete exactly one of those two characters, shrinking the string each time.