Codeforces Round 735 (Div. 2)

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

5 items

Codeforces Round 735 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 800-2600 | 14m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Cherry	800	greedy	31,366	1m 42s	✓
B	Cobb	1700	bitmasks, brute-force, greedy	13,796	4m 33s	✓
C	Mikasa	1800	binary-search, bitmasks, greedy	9,774	3m 44s
D	Diane	1800	constructive-algorithms, greedy, strings	10,559	1m 45s
E	You	2600	dfs-and-similar, dp, math	1,374	2m 39s	✓

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

CF 1554C - Mikasa

We are given a fixed integer n and a range of integers 0, 1, 2, ..., m. Each number in this range is XORed with n, producing a set of values. From this resulting set, we want the smallest non-negative integer that does not appear.

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

CF 1554D - Diane

We are asked to construct a string of length n using lowercase English letters such that a very strong parity condition holds: every non-empty substring must appear inside the string an odd number of times when we count all occurrences.

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

CF 1554B - Cobb

We are given an array of values indexed from one, and we want to choose two different positions in this array. For any chosen pair of indices, we compute a score made of two competing parts: a positive term that grows with the product of the indices, and a penalty term that…

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

CF 1554E - You

We are given a tree with $n$ nodes, which is a connected acyclic graph, and we need to construct sequences by repeatedly erasing nodes.

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

CF 1554A - Cherry

We are given an array of positive integers. For every subarray that contains at least two elements, we compute the product of its largest element and its smallest element. The task is to find the maximum such product among all possible subarrays.