Educational Codeforces Round 52 (Rated for Div. 2)

7 problems from Educational Codeforces Round 52 (Rated for Div. 2) (contest 1065), difficulty 800-2700. 3/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 52 (Rated for Div. 2)

Div. 2 | 7 problems | 3/7 verified | Difficulty 800-2700 | 26m 32s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Vasya and Chocolate	800	implementation, math	15,264	3m 48s	✓
B	Vasya and Isolated Vertices	1300	constructive-algorithms, graphs	11,597	5m 51s
C	Make It Equal	1600	greedy	8,290	2m 44s	✓
D	Three Pieces	2200	dfs-and-similar, dp, shortest-paths	1,445	3m 34s	✓
E	Side Transmutations	2300	combinatorics, strings	1,294	2m 41s
F	Up and Down the Tree	2500	dfs-and-similar, dp, trees	1,324	5m 1s
G	Fibonacci Suffix	2700	strings	312	2m 53s

Practice › Codeforces Solutions › Educational Codeforces Round 52 (Rated for Div. 2) ›

CF 1065F - Up and Down the Tree

We are given a rooted tree with vertex 1 as the root, and every vertex except the root has exactly one parent defined by the input. Some vertices are leaves in the usual sense of the tree structure.

Practice › Codeforces Solutions › Educational Codeforces Round 52 (Rated for Div. 2) ›

CF 1065G - Fibonacci Suffix

We are working with a family of binary strings built in the same recursive way as Fibonacci numbers, except instead of addition we concatenate strings.

Practice › Codeforces Solutions › Educational Codeforces Round 52 (Rated for Div. 2) ›

CF 1065E - Side Transmutations

We are given strings of length n over an alphabet of size Instead of tracking how a single string evolves, the real question is to understand which positions in the string are fundamentally indistinguishable under repeated application of these operations.

Practice › Codeforces Solutions › Educational Codeforces Round 52 (Rated for Div. 2) ›

CF 1065D - Three Pieces

We are given an $N times N$ grid where every cell contains a unique number from $1$ to $N^2$. These numbers define a forced visiting order: we must start at the cell containing 1, then eventually reach the cell containing 2, then 3, and continue in increasing order until $N^2$.

Practice › Codeforces Solutions › Educational Codeforces Round 52 (Rated for Div. 2) ›

CF 1065B - Vasya and Isolated Vertices

We are given a simple undirected graph with a fixed number of vertices and edges. The graph has no self-loops and no duplicate edges.

Practice › Codeforces Solutions › Educational Codeforces Round 52 (Rated for Div. 2) ›

CF 1065A - Vasya and Chocolate

Vasya has a fixed amount of money and wants to maximize how many chocolate bars he ends up with under a repeating promotion. Every bar has a fixed price, so his initial purchasing power is simply how many bars he can buy directly.

Practice › Codeforces Solutions › Educational Codeforces Round 52 (Rated for Div. 2) ›

CF 1065C - Make It Equal

We are given a collection of vertical towers, each represented by a positive integer height. In one operation we choose a target height $H$, and then every tower that is taller than $H$ is cut down to exactly $H$, while shorter towers remain unchanged.