Codeforces Round 750 (Div. 2)

8 problems from Codeforces Round 750 (Div. 2) (contest 1582), difficulty 800-2600. 6/8 solutions verified against sample I/O.

8 items

Codeforces Round 750 (Div. 2)

Div. 2 | 8 problems | 6/8 verified | Difficulty 800-2600 | 37m 4s

# Problem Rating Tags Accepted Time ✓
A Luntik and Concerts 800 math 19,751 4m 23s ✓
B Luntik and Subsequences 900 combinatorics, math 33,330 1m 34s ✓
C Grandma Capa Knits a Scarf 1200 brute-force, data-structures, greedy 23,625 4m 27s ✓
D Vupsen, Pupsen and 0 1600 constructive-algorithms, math 11,588 9m 4s
E Pchelyonok and Segments 2000 binary-search, data-structures, dp 4,212 4m 39s ✓
F1 Korney Korneevich and XOR (easy version) 1800 bitmasks, dp, greedy 6,579 5m 26s ✓
F2 Korney Korneevich and XOR (hard version) 2400 binary-search, brute-force, dp 2,088 1m 42s ✓
G Kuzya and Homework 2600 data-structures, number-theory 698 5m 49s
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582G - Kuzya and Homework

We are given a sequence of numbers and a sequence of operations placed between them. We start each segment with value 1, then apply the operations from left to right. Each position either multiplies the current value by the given number or divides it by that number.
codeforces competitive-programming data-structures number-theory Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582D - Vupsen, Pupsen and 0

We are given several test cases. In each one, we start with an array of nonzero integers $a$. Our task is to construct another array $b$ of the same length such that two conditions hold simultaneously. First, no element of $b$ is allowed to be zero.
codeforces competitive-programming constructive-algorithms math Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582E - Pchelyonok and Segments

We are given an array of positive integers and asked to construct a sequence of non-overlapping subarrays. These subarrays must be chosen in order from left to right, and their lengths are fixed to form a decreasing sequence starting from some value $k$ down to $1$.
codeforces competitive-programming binary-search data-structures dp greedy math Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582C - Grandma Capa Knits a Scarf

We are given a string made of lowercase letters. We are allowed to pick exactly one letter of the alphabet, and then delete any occurrences of that chosen letter from the string, possibly none or all of them.
codeforces competitive-programming brute-force data-structures greedy strings two-pointers Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582A - Luntik and Concerts

We are given a collection of songs split into three types: some last 1 minute, some last 2 minutes, and some last 3 minutes. For each test case, we must assign every song to one of two concerts.
codeforces competitive-programming math Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582F1 - Korney Korneevich and XOR (easy version)

We are given an array of integers, and the task is to determine all possible values of x that can be obtained as the XOR of some increasing subsequence of the array.
codeforces competitive-programming bitmasks dp greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582F2 - Korney Korneevich and XOR (hard version)

We are given an array of integers a of length n. The task is to find all non-negative integers x that can be expressed as the XOR of some strictly increasing subsequence of a.
codeforces competitive-programming binary-search brute-force dp greedy two-pointers Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 750 (Div. 2) ›

CF 1582B - Luntik and Subsequences

We are given several arrays. For each array, let the sum of all elements be $s$. We need to count how many subsequences have sum exactly $s-1$. A subsequence is formed by deleting any number of elements, possibly none of them or all of them.
codeforces competitive-programming combinatorics math Jun 10, 2026