Codeforces Round 638 (Div. 2)

4 problems from Codeforces Round 638 (Div. 2) (contest 1348), difficulty 1400-2400. 1/4 solutions verified against sample I/O.

4 items

Codeforces Round 638 (Div. 2)

Div. 2 | 4 problems | 1/4 verified | Difficulty 1400-2400 | 19m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Phoenix and Beauty	1400	constructive-algorithms, data-structures, greedy	27,483	5m 10s
C	Phoenix and Distribution	1600	constructive-algorithms, greedy, sortings	15,480	5m 1s
D	Phoenix and Science	1900	binary-search, constructive-algorithms, greedy	9,341	2m 53s
E	Phoenix and Berries	2400	brute-force, dp, greedy	2,429	6m 19s	✓

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

CF 1348E - Phoenix and Berries

We are given several shrubs, each containing two independent piles of berries: red and blue. From these sources we want to form as many baskets as possible, where every basket must contain exactly $k$ berries.

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

CF 1348B - Phoenix and Beauty

We are given an array and allowed to insert additional values anywhere inside it, where every inserted value must stay within the same value range as the original array elements.

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

CF 1348C - Phoenix and Distribution

We are given a string made of lowercase letters and we are allowed to split all of its characters into exactly k non-empty groups. Inside each group, we can reorder characters arbitrarily, so each group is effectively just a multiset of letters that we later sort into a string.

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

CF 1348D - Phoenix and Science

Let $u(x)$ be a polynomial with integer coefficients that is squarefree over $mathbb{Z}$. This means that $u(x)$ has no repeated roots in $mathbb{C}$, equivalently, $gcd(u(x), u'(x)) = 1$ in $mathbb{Z}[x]$, where $u'(x)$ is the derivative of $u(x)$.