Codeforces Round 1006 (Div. 3)

7 problems from Codeforces Round 1006 (Div. 3) (contest 2072), difficulty 800-2200. 3/7 solutions verified against sample I/O.

7 items

Codeforces Round 1006 (Div. 3)

Div. 3 | 7 problems | 3/7 verified | Difficulty 800-2200 | 9m 36s

# Problem Rating Tags Accepted Time ✓
A New World, New Me, New Array 800 greedy, implementation, math 40,653 1m 11s ✓
B Having Been a Treasurer in the Past, I Help Goblins Deceive 900 combinatorics, constructive-algorithms, strings 30,929 1m 6s ✓
C Creating Keys for StORages Has Become My Main Skill 1200 bitmasks, constructive-algorithms, greedy 19,567 1m 29s
D For Wizards, the Exam Is Easy, but I Couldn't Handle It 1300 brute-force, greedy, implementation 17,633 1m 31s
E Do You Love Your Hero and His Two-Hit Multi-Target Attacks? 1500 binary-search, brute-force, constructive-algorithms 12,264 1m 26s
F Goodbye, Banker Life 1700 2-sat, bitmasks, combinatorics 8,443 1m 31s ✓
G I've Been Flipping Numbers for 300 Years and Calculated the Sum 2200 binary-search, brute-force, combinatorics 2,146 1m 22s
Practice › Codeforces Solutions › Codeforces Round 1006 (Div. 3) ›

CF 2072G - I've Been Flipping Numbers for 300 Years and Calculated the Sum

We are given a number n and a limit k. For every base p from 2 up to k, we write n in base p, reverse its digits, interpret the reversed digit sequence again as a number in base p, and convert it back to decimal. That resulting value is added into a running sum.
codeforces competitive-programming binary-search brute-force combinatorics divide-and-conquer math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1006 (Div. 3) ›

CF 2072F - Goodbye, Banker Life

We start with a triangle whose first row contains a single value k. Every later row is built from the previous one. The two border elements are copied from the row above, while every interior element becomes the XOR of the two adjacent elements above it.
codeforces competitive-programming 2-sat bitmasks combinatorics constructive-algorithms fft math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1006 (Div. 3) ›

CF 2072D - For Wizards, the Exam Is Easy, but I Couldn't Handle It

We are given an array of integers and asked to perform a single operation: select a contiguous subarray and cyclically shift it one position to the left. After this operation, we want the total number of inversions in the array to be as small as possible.
codeforces competitive-programming brute-force greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1006 (Div. 3) ›

CF 2072E - Do You Love Your Hero and His Two-Hit Multi-Target Attacks?

The task is to place a number of points on a 2D integer grid such that exactly k pairs of points have Manhattan distance equal to Euclidean distance.
codeforces competitive-programming binary-search brute-force constructive-algorithms dp geometry greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1006 (Div. 3) ›

CF 2072C - Creating Keys for StORages Has Become My Main Skill

The problem asks us to construct an array of length n such that its elements bitwise OR to a target value x while maximizing the MEX of the array. The MEX, or minimum excluded value, is the smallest non-negative integer not present in the array.
codeforces competitive-programming bitmasks constructive-algorithms greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1006 (Div. 3) ›

CF 2072A - New World, New Me, New Array

We start with an array of n zeros. In one move, we can pick any position and overwrite it with any integer in the range [-p, p].
codeforces competitive-programming greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1006 (Div. 3) ›

CF 2072B - Having Been a Treasurer in the Past, I Help Goblins Deceive

We are given a string made only of two symbols, a dash and an underscore. We are allowed to reorder this string arbitrarily.
codeforces competitive-programming combinatorics constructive-algorithms strings Jun 8, 2026