Codeforces Round 941 (Div. 2)

Solutions for Codeforces Round 941 (Div. 2) (contest 1966). 1/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 941 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2900 | Time: 16m 6s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Card Exchange	800	constructive-algorithms, games, greedy	4m 54s	✗
B	Rectangle Filling	1100	constructive-algorithms, implementation	1m 34s	✓
C	Everything Nim	1400	games, greedy	1m 43s	✗
D	Missing Subsequence Sum	1800	constructive-algorithms, greedy, math	3m 24s	✗
E	Folding Strip	2300	greedy, implementation	2m 28s	✗
F	Missing Subarray Sum	2900	constructive-algorithms	2m 3s	✗

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

CF 1966F - Missing Subarray Sum

We are asked to reconstruct a hidden array of positive integers that is a palindrome, given nearly all of its subarray sums. Each subarray sum corresponds to the sum of a contiguous segment of the array, and exactly one subarray sum is missing.

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

CF 1966D - Missing Subsequence Sum

The task is to construct a small sequence of non-negative integers such that every sum from 1 to $n$, except a single forbidden value $k$, can be represented as the sum of some subsequence.

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

CF 1966A - Card Exchange

We are given a hand of cards, each labeled with a number, and a fixed integer $k$. The operation allowed is to take any $k$ identical cards and exchange them for $k-1$ cards of any number we choose. The goal is to reduce the total number of cards as much as possible.

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

CF 1966E - Folding Strip

We are given a binary string representing a strip of paper with 0s and 1s. We can fold the strip at any position between adjacent characters.

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

CF 1966C - Everything Nim

We are asked to analyze a two-player game with multiple piles of stones. On a player's turn, they choose a number $k$ that does not exceed the smallest non-empty pile, then remove $k$ stones from every pile that still has stones.

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

CF 1966B - Rectangle Filling

We are given a grid of size $n times m$ filled with black and white tiles. Each tile is either 'B' (black) or 'W' (white). The task is to determine whether it is possible, using a series of rectangle-filling operations, to make all tiles in the grid the same color.