Codeforces Round 950 (Div. 3)

Solutions for Codeforces Round 950 (Div. 3) (contest 1980). 4/8 problems verified against sample I/O. Difficulty range: 800-2400.

8 items

Codeforces Round 950 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 4/8 | Rating range: 800-2400 | Time: 19m 52s

Problem Name Rating Tags Solve Time Verified
A Problem Generator 800 math 1m 17s ✓
B Choosing Cubes 800 sortings 1m 20s ✓
C Sofia and the Lost Operations 1300 constructive-algorithms, greedy 3m 4s ✓
D GCD-sequence 1400 greedy, implementation, math 1m 58s ✗
E Permutation of Rows and Columns 1600 constructive-algorithms, data-structures, greedy 1m 20s ✓
F1 Field Division (easy version) 1900 data-structures, math, sortings 5m 31s ✗
F2 Field Division (hard version) 2400 math, sortings 2m 34s ✗
G Yasya and the Mysterious Tree 2300 bitmasks, data-structures, dfs-and-similar 2m 48s ✗
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980F1 - Field Division (easy version)

We are asked to divide a rectangular field of size $n times m$ between Alice and Bob. The field contains $k$ fountains at distinct cells, and Alice wants to choose a monotone path-moving only right or down-from the top or left side to the bottom or right side such that she…
codeforces competitive-programming data-structures math sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980G - Yasya and the Mysterious Tree

We are given a tree with n vertices. Each edge in this tree has a weight. There are m queries of two types. The first type changes the effective weights of all edges by XORing them with a given number y.
codeforces competitive-programming bitmasks data-structures dfs-and-similar graphs greedy strings trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980F2 - Field Division (hard version)

A monotone path that moves only right and down separates the rectangle into a south-west part owned by Alice and a north-east part owned by Bob. I
codeforces competitive-programming math sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980D - GCD-sequence

We are given an array of positive integers. From it, we can derive a second array by replacing every adjacent pair with their greatest common divisor. This derived array reflects how “compatible” neighboring values are in terms of shared divisors.
codeforces competitive-programming greedy implementation math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980C - Sofia and the Lost Operations

We are asked to determine whether a given array b could have been produced from an original array a by applying a sequence of assignment operations where the target indices are lost, but the values assigned in order are known.
codeforces competitive-programming constructive-algorithms greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980E - Permutation of Rows and Columns

We are given two rectangular grids of numbers, both of size $n times m$, and together they contain exactly the numbers from $1$ to $n cdot m$, each appearing once. So each matrix is just a rearrangement of the same set of tiles.
codeforces competitive-programming constructive-algorithms data-structures greedy hashing implementation math matrices sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980B - Choosing Cubes

We are given several independent scenarios where a collection of numbered cubes is rearranged based on their values. One cube is special because it is the favorite, identified by its original position.
codeforces competitive-programming sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 950 (Div. 3) ›

CF 1980A - Problem Generator

Each test case describes a small problem set that Vlad already owns and a target number of rounds he wants to organize. Every problem has one of seven possible difficulty labels from A to G.
codeforces competitive-programming math Jun 8, 2026