Codeforces Round 508 (Div. 2)

5 problems from Codeforces Round 508 (Div. 2) (contest 1038), difficulty 800-2900. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 508 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 800-2900 | 25m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Equality	800	implementation, strings	15,644	11m 47s
B	Non-Coprime Partition	1100	constructive-algorithms, math	14,714	2m 54s	✓
D	Slime	1800	dp, greedy, implementation	8,861	1m 47s
E	Maximum Matching	2400	bitmasks, brute-force, dfs-and-similar	1,095	4m 42s	✓
F	Wrap Around	2900	dp, strings	478	4m 41s	✓

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

CF 1038A - Equality

We are given a string made of uppercase letters, but only from the first $k$ letters of the alphabet. The task is not to rearrange or modify the string, but to select a subsequence of characters while preserving order.

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

CF 1038F - Wrap Around

We are given a binary string s and a length n. We want to construct all binary strings t of length n. Each such t is treated as circular, meaning its end wraps back to its beginning.

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

CF 1038E - Maximum Matching

Each block can be viewed as a weighted undirected edge between two colors, where each endpoint is one of two possible colors depending on orientation.

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

CF 1038D - Slime

We are given a line of slimes, each carrying an integer value, and we repeatedly perform an operation where one slime absorbs an adjacent slime. If a slime with value $x$ eats a neighbor with value $y$, that neighbor disappears and the eater’s value becomes $x - y$.

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

CF 1038B - Non-Coprime Partition

We are given the integers from 1 to n, and we must split them into two non-empty groups so that every number is used exactly once. After splitting, we compute the sum of numbers in each group and look at the greatest common divisor of these two sums.