Codeforces Round 936 (Div. 2)

Solutions for Codeforces Round 936 (Div. 2) (contest 1946). 1/5 problems verified against sample I/O. Difficulty range: 800-2500.

5 items

Codeforces Round 936 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 1/5 | Rating range: 800-2500 | Time: 10m 41s

Problem Name Rating Tags Solve Time Verified
A Median of an Array 800 greedy, implementation, sortings 2m 44s ✗
B Maximum Sum 1100 dp, greedy, math 2m 45s ✗
C Tree Cutting 1600 binary-search, dp, greedy 2m 50s ✓
D Birthday Gift 1900 bitmasks, brute-force, constructive-algorithms 1m 7s ✗
F Nobody is needed 2500 2-sat, data-structures, dfs-and-similar 1m 15s ✗
Practice › Codeforces Solutions › Codeforces Round 936 (Div. 2) ›

CF 1946A - Median of an Array

We are given an array of integers, and our task is to increase its median by performing a series of operations. Each operation consists of picking a single element and incrementing it by one.
codeforces competitive-programming greedy implementation sortings May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 936 (Div. 2) ›

CF 1946B - Maximum Sum

We are given an array of integers and we are allowed to perform exactly k operations. Each operation lets us pick any contiguous segment of the current array, compute its sum, and insert that sum back into the array at any position.
codeforces competitive-programming dp greedy math May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 936 (Div. 2) ›

CF 1946C - Tree Cutting

We are given a tree with $n$ vertices, which is a connected graph without cycles. The task is to remove exactly $k$ edges from this tree and determine the largest integer $x$ such that each resulting connected component has at least $x$ vertices.
codeforces competitive-programming binary-search dp greedy implementation trees May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 936 (Div. 2) ›

CF 1946D - Birthday Gift

We are given an array and we are allowed to split it into a sequence of contiguous segments. Each segment is evaluated by taking the bitwise XOR of its elements.
codeforces competitive-programming bitmasks brute-force constructive-algorithms greedy implementation May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 936 (Div. 2) ›

CF 1946F - Nobody is needed

We are given a permutation of the numbers from 1 to n. Each query gives us a segment $[l, r]$, and we are asked to count how many strictly increasing index sequences we can choose inside this segment such that every next chosen value is divisible by the previous chosen value.
codeforces competitive-programming 2-sat data-structures dfs-and-similar dp May 31, 2026