Codeforces Round 737 (Div. 2)

3 problems from Codeforces Round 737 (Div. 2) (contest 1557), difficulty 800-1700. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 737 (Div. 2)

Div. 2 | 3 problems | 3/3 verified | Difficulty 800-1700 | 12m 1s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Ezzat and Two Subsequences	800	brute-force, math, sortings	29,144	3m 16s	✓
B	Moamen and k-subarrays	1100	greedy, sortings	24,608	3m 16s	✓
C	Moamen and XOR	1700	bitmasks, combinatorics, dp	10,496	5m 29s	✓

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

CF 1557A - Ezzat and Two Subsequences

We are given an array of integers, and we must split it into two non-empty groups while preserving every element exactly once. Each group has a score equal to its arithmetic mean, and the goal is to maximize the sum of these two means.

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

CF 1557B - Moamen and k-subarrays

We are given an array of distinct integers and allowed to perform a very specific transformation exactly once. First, we cut the array into exactly k contiguous pieces, each piece non-empty.

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

CF 1557C - Moamen and XOR

We are counting how many arrays of length n can be formed when each element is an integer in the range [0, 2^k - 1], with the additional constraint that a certain bitwise inequality holds.