Codeforces Round 1010 (Div. 2, Unrated)

Solutions for Codeforces Round 1010 (Div. 2, Unrated) (contest 2082). 3/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Codeforces Round 1010 (Div. 2, Unrated)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-2700 | Time: 11m 9s

Problem Name Rating Tags Solve Time Verified
A Binary Matrix 800 constructive-algorithms, greedy 1m 33s ✓
B Floor or Ceil 1600 brute-force, greedy 2m 36s ✗
C Math Division 1800 bitmasks, dp, math 1m 21s ✓
D Balancing 2500 greedy 2m 41s ✓
E Quaternary Matrix 2700 bitmasks, greedy 1m 41s ✗
F MST in Modulo Graph 2600 constructive-algorithms, graphs, greedy 1m 17s ✗
Practice › Codeforces Solutions › Codeforces Round 1010 (Div. 2, Unrated) ›

CF 2082F - MST in Modulo Graph

We are asked to compute the minimum spanning tree (MST) of a complete graph, but the edge weights are unusual. Each vertex has an associated weight $pi$, and the weight of an edge between two vertices $x$ and $y$ is defined as $max(px, py) bmod min(px, py)$.
codeforces competitive-programming constructive-algorithms graphs greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1010 (Div. 2, Unrated) ›

CF 2082E - Quaternary Matrix

We are given a matrix where each cell contains a number between 0 and 3. The task is to transform this matrix into what the problem calls a "good" matrix. A matrix is good if the XOR of all elements in every row is zero and the XOR of all elements in every column is zero.
codeforces competitive-programming bitmasks greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1010 (Div. 2, Unrated) ›

CF 2082D - Balancing

The only thing that matters about the original array is the sign of every adjacent comparison. For each position $i$, define an edge between $ai$ and $a{i+1}$. If $ai < a{i+1}$, call the edge positive. If $ai a{i+1}$, call the edge negative.
codeforces competitive-programming greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1010 (Div. 2, Unrated) ›

CF 2082B - Floor or Ceil

We start with an integer value and must perform two kinds of halving operations a fixed number of times. One operation replaces the current value with the floor of half the value. The other replaces it with the ceiling of half the value.
codeforces competitive-programming brute-force greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1010 (Div. 2, Unrated) ›

CF 2082C - Math Division

We are given a positive integer in binary representation, and the task is to compute the expected number of operations needed to reduce this number to 1.
codeforces competitive-programming bitmasks dp math probabilities Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1010 (Div. 2, Unrated) ›

CF 2082A - Binary Matrix

We are given a binary matrix of size $n times m$, meaning each element is either $0$ or $1$. The goal is to make this matrix "good" by performing the minimum number of element flips.
codeforces competitive-programming constructive-algorithms greedy Jun 8, 2026