Codeforces Round 1027 (Div. 3)

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

7 items

Codeforces Round 1027 (Div. 3)

Div. 3 | 7 problems | 0/7 verified | Difficulty 800-2200 | 11m 35s

# Problem Rating Tags Accepted Time ✓
A Square Year 800 binary-search, brute-force, math 43,168 1m 31s
B Not Quite a Palindromic String 900 greedy, math 30,490 1m 47s
C Need More Arrays 1000 dp, greedy 30,879 2m 8s
D Come a Little Closer 1400 brute-force, greedy, implementation 14,635 1m 28s
E Kirei Attacks the Estate 1400 dfs-and-similar, dp, greedy 13,995 1m 29s
F Small Operations 2000 binary-search, brute-force, dfs-and-similar 5,501 1m 36s
G Build an Array 2200 brute-force, constructive-algorithms, dp 2,038 1m 36s
Practice › Codeforces Solutions › Codeforces Round 1027 (Div. 3) ›

CF 2114G - Build an Array

We start from an empty array and repeatedly append integers either to its left end or right end. After each insertion, the array may simplify itself: whenever two identical neighbors appear, they merge into a single element equal to their sum.
codeforces competitive-programming brute-force constructive-algorithms dp greedy math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1027 (Div. 3) ›

CF 2114F - Small Operations

We are given two integers, x and y, and an upper bound k. Our goal is to transform x into y using the fewest possible operations.
codeforces competitive-programming binary-search brute-force dfs-and-similar dp math number-theory sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1027 (Div. 3) ›

CF 2114E - Kirei Attacks the Estate

We are given a rooted tree where vertex 1 is the root, and each vertex has a numeric value. For every vertex $v$, we consider the path going upward from $v$ to the root.
codeforces competitive-programming dfs-and-similar dp greedy trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1027 (Div. 3) ›

CF 2114D - Come a Little Closer

We are asked to destroy all monsters on a very large $10^9 times 10^9$ grid. Each monster occupies a distinct cell, and we are allowed to move exactly one monster to any empty cell before selecting a rectangle that covers some contiguous region of the grid.
codeforces competitive-programming brute-force greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1027 (Div. 3) ›

CF 2114C - Need More Arrays

We are given a non-decreasing array of integers. The task is to remove zero or more elements to maximize the number of arrays formed according to a sequential rule.
codeforces competitive-programming dp greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1027 (Div. 3) ›

CF 2114B - Not Quite a Palindromic String

We are given a binary string of even length and a target number of good pairs. A good pair consists of two characters symmetrically positioned around the center that are equal.
codeforces competitive-programming greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1027 (Div. 3) ›

CF 2114A - Square Year

We are given a four-digit year as a string, potentially including leading zeros, and we are asked to determine if this number can be expressed as the square of the sum of two non-negative integers.
codeforces competitive-programming binary-search brute-force math Jun 8, 2026