Codeforces Round 1008 (Div. 1)

7 problems from Codeforces Round 1008 (Div. 1) (contest 2077), difficulty 1500-3500. 2/7 solutions verified against sample I/O.

7 items

Codeforces Round 1008 (Div. 1)

Div. 1 | 7 problems | 2/7 verified | Difficulty 1500-3500 | 9m 25s

# Problem Rating Tags Accepted Time ✓
A Breach of Faith 1500 constructive-algorithms, greedy, math 14,573 1m 43s
B Finding OR Sum 3,654
C Binary Subsequence Value Sum 2300 combinatorics, data-structures, dp 2,379 1m 58s ✓
D Maximum Polygon 3100 brute-force, data-structures, greedy 339 1m 41s
E Another Folding Strip 2700 combinatorics, constructive-algorithms, data-structures 607 1m 40s
F AND x OR 3300 bitmasks, constructive-algorithms, dp 261 1m 36s
G RGB Walking 3500 bitmasks, chinese-remainder-theorem, dfs-and-similar 135 47s ✓
Practice › Codeforces Solutions › Codeforces Round 1008 (Div. 1) ›

Practice › Codeforces Solutions › Codeforces Round 1008 (Div. 1) ›

CF 2077G - RGB Walking

The problem gives a connected graph with n vertices and m edges. Each edge has three pieces of information: its endpoints, a positive integer weight no larger than x, and a color which is either red, green, or blue.
codeforces competitive-programming bitmasks chinese-remainder-theorem dfs-and-similar graphs number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1008 (Div. 1) ›

CF 2077F - AND x OR

We are given two arrays, a and b, of equal length n, containing nonnegative integers up to some maximum m. The goal is to perform minimal increment operations on elements of a or b so that the resulting pair (a, b) becomes good in the sense defined by the problem: for some…
codeforces competitive-programming bitmasks constructive-algorithms dp Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1008 (Div. 1) ›

CF 2077E - Another Folding Strip

We are given an array, and we need to look at every contiguous subarray. For each subarray, we imagine it as a sequence of target heights on a strip.
codeforces competitive-programming combinatorics constructive-algorithms data-structures divide-and-conquer dp greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1008 (Div. 1) ›

CF 2077D - Maximum Polygon

We are given an array and we are asked to choose a subsequence of it, meaning we can delete elements but cannot reorder what remains.
codeforces competitive-programming brute-force data-structures greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1008 (Div. 1) ›

CF 2077C - Binary Subsequence Value Sum

Every character of the string contributes either +1 or -1. If we define $$w(c)= begin{cases} +1,&c='1' -1,&c='0' end{cases}$$ then for any segment of a binary string, the function $F$ is simply the sum of these values over that segment.
codeforces competitive-programming combinatorics data-structures dp fft math matrices Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1008 (Div. 1) ›

CF 2077A - Breach of Faith

We are given a sequence of $2n+1$ distinct positive integers satisfying a specific alternating sum property: the first element equals the alternating sum of the remaining elements.
codeforces competitive-programming constructive-algorithms greedy math sortings Jun 8, 2026