Codeforces Round 1016 (Div. 3)

7 problems from Codeforces Round 1016 (Div. 3) (contest 2093), difficulty 800-1900. 5/7 solutions verified against sample I/O.

7 items

Codeforces Round 1016 (Div. 3)

Div. 3 | 7 problems | 5/7 verified | Difficulty 800-1900 | 11m 23s

# Problem Rating Tags Accepted Time ✓
A Ideal Generator 800 math 40,823 1m 9s ✓
B Expensive Number 900 greedy, math 30,827 1m 48s ✓
C Simple Repetition 1000 math, number-theory 30,833 1m 34s ✓
D Skibidi Table 1400 bitmasks, implementation 12,268 1m 20s ✓
E Min Max MEX 1500 binary-search, brute-force, greedy 13,436 1m 14s ✓
F Hackers and Neural Networks 1800 bitmasks, brute-force, greedy 5,881 2m 33s
G Shorten the Array 1900 binary-search, bitmasks, data-structures 3,801 1m 45s
Practice › Codeforces Solutions › Codeforces Round 1016 (Div. 3) ›

CF 2093F - Hackers and Neural Networks

Working
codeforces competitive-programming bitmasks brute-force greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1016 (Div. 3) ›

CF 2093G - Shorten the Array

We are asked to find the shortest subarray of a given array a whose "beauty" reaches or exceeds a threshold k. The beauty of an array is the maximum XOR value between any pair of its elements.
codeforces competitive-programming binary-search bitmasks data-structures dfs-and-similar greedy strings trees two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1016 (Div. 3) ›

CF 2093E - Min Max MEX

We are given an array and asked to cut it into exactly k contiguous pieces that together cover the whole array. Once the array is split, each piece has a MEX value, and we care about the worst piece, meaning the smallest MEX among all k segments.
codeforces competitive-programming binary-search brute-force greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1016 (Div. 3) ›

CF 2093D - Skibidi Table

We are filling a $2^n times 2^n$ grid with integers from $1$ to $2^{2n}$, but the order is not row-major or column-major. Instead, the grid is constructed recursively.
codeforces competitive-programming bitmasks implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1016 (Div. 3) ›

CF 2093B - Expensive Number

We are given a decimal number as a string. We may delete any subset of its digits while preserving the relative order of the remaining digits. The resulting sequence of digits must represent a positive number, although leading zeros are allowed.
codeforces competitive-programming greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1016 (Div. 3) ›

CF 2093C - Simple Repetition

We are given a base integer x and a repetition count k. From x, we construct a new number y by writing the decimal representation of x consecutively k times without inserting separators. For example, if x = 52 and k = 3, then y = 525252. If x = 6 and k = 7, then y = 6666666.
codeforces competitive-programming math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1016 (Div. 3) ›

CF 2093A - Ideal Generator

We are given a number $k$. The task is to decide whether it is possible to represent every integer $n ge k$ as the sum of a palindromic array of length exactly $k$, where all elements are positive integers.
codeforces competitive-programming math Jun 8, 2026