Codeforces Round 628 (Div. 2)

3 problems from Codeforces Round 628 (Div. 2) (contest 1325), difficulty 800-2600. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 628 (Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 800-2600 | 12m 30s

#	Problem	Rating	Tags	Accepted	Time	✓
B	CopyCopyCopyCopyCopy	800	greedy, implementation	38,820	3m 14s	✓
C	Ehab and Path-etic MEXs	1500	constructive-algorithms, dfs-and-similar, greedy	17,153	1m 7s
E	Ehab's REAL Number Theory Problem	2600	brute-force, dfs-and-similar, graphs	2,335	8m 9s	✓

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

CF 1325E - Ehab's REAL Number Theory Problem

We are given a sequence of integers, and we want to select a subsequence whose product becomes a perfect square. Among all such subsequences, we need the minimum possible length.

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

CF 1325B - CopyCopyCopyCopyCopy

We are given an array and we construct a much larger array by repeating it end-to-end many times. The repetition count is equal to the original length of the array, so the final sequence has size $n cdot n$.

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

CF 1325C - Ehab and Path-etic MEXs

We are given a tree with $n$ nodes, represented by $n-1$ edges connecting pairs of nodes. Each edge must be assigned a distinct integer label between $0$ and $n-2$.