Codeforces Round 941 (Div. 1)

6 problems from Codeforces Round 941 (Div. 1) (contest 1965), difficulty 1400-3300. 0/6 solutions verified against sample I/O.

6 items

Codeforces Round 941 (Div. 1)

Div. 1 | 6 problems | 0/6 verified | Difficulty 1400-3300 | 7m 12s

#	Problem	Rating	Tags	Accepted	Time
A	Everything Nim	1400	games, greedy, math	16,701	1m 24s
B	Missing Subsequence Sum	1800	bitmasks, constructive-algorithms, greedy	8,119	1m 17s
C	Folding Strip	2300	constructive-algorithms, greedy, strings	2,353	1m 8s
D	Missing Subarray Sum	2900	constructive-algorithms	536	1m 5s
E	Connected Cubes	3100	constructive-algorithms, games	466	1m 10s
F	Conference	3300	data-structures, flows	279	1m 8s

Practice › Codeforces Solutions › Codeforces Round 941 (Div. 1) ›

CF 1965A - Everything Nim

We are given several independent games, each defined by a list of piles containing stones. Two players alternate turns.

Practice › Codeforces Solutions › Codeforces Round 941 (Div. 1) ›

CF 1965B - Missing Subsequence Sum

We are asked to construct an array of non-negative integers such that the sums of all subsequences cover every integer from 1 to $n$, except for a single forbidden sum $k$. Each test case gives the upper bound $n$ and the forbidden sum $k$.

Practice › Codeforces Solutions › Codeforces Round 941 (Div. 1) ›

CF 1965C - Folding Strip

We are given a binary string that represents a long paper strip with 0/1 values printed on it. We are allowed to choose any number of cut positions between adjacent characters, and then fold segments of the strip on top of each other simultaneously.

Practice › Codeforces Solutions › Codeforces Round 941 (Div. 1) ›

CF 1965D - Missing Subarray Sum

We are given a multiset that contains almost all subarray sums of an unknown array a, where a has two special properties: every element is strictly positive and the array reads the same forwards and backwards.

Practice › Codeforces Solutions › Codeforces Round 941 (Div. 1) ›

CF 1965E - Connected Cubes

We are given an $n times m$ grid sitting at height $z=1$, where each cell already contains a unit cube with a color.

Practice › Codeforces Solutions › Codeforces Round 941 (Div. 1) ›

CF 1965F - Conference

We are given a collection of time intervals, each interval belonging to a different lecturer. Lecturer i is available on a continuous range of days from li to ri, and can be assigned to at most one conference day.