Educational Codeforces Round 76 (Rated for Div. 2)

7 problems from Educational Codeforces Round 76 (Rated for Div. 2) (contest 1257), difficulty 800-2600. 5/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 76 (Rated for Div. 2)

Div. 2 | 7 problems | 5/7 verified | Difficulty 800-2600 | 33m 32s

# Problem Rating Tags Accepted Time ✓
A Two Rival Students 800 greedy, math 21,661 2m 1s ✓
B Magic Stick 1000 math 22,520 11m 28s
C Dominated Subarray 1200 greedy, implementation, sortings 17,143 4m 19s ✓
D Yet Another Monster Killing Problem 1700 binary-search, data-structures, dp 8,172 3m 35s ✓
E The Contest 2000 data-structures, dp, greedy 4,535 2m 34s ✓
F Make Them Similar 2400 bitmasks, brute-force, hashing 2,315 7m 36s
G Divisor Set 2600 divide-and-conquer, fft, greedy 735 1m 59s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 76 (Rated for Div. 2) ›

CF 1257F - Make Them Similar

We are given a fixed array of integers. We are allowed to choose a single integer x and apply it to every element using XOR. After this transformation, each original value ai becomes bi = ai XOR x.
codeforces competitive-programming bitmasks brute-force hashing meet-in-the-middle Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 76 (Rated for Div. 2) ›

CF 1257B - Magic Stick

We are given a starting integer and a target integer. From the starting value, we are allowed to repeatedly apply one of two transformations: if the current value is even, we may replace it with three halves of itself, and if the value is greater than one, we may reduce it by…
codeforces competitive-programming math Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 76 (Rated for Div. 2) ›

CF 1257C - Dominated Subarray

We are given several arrays, and for each one we need to find the shortest contiguous segment that has a strict majority element.
codeforces competitive-programming greedy implementation sortings strings two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 76 (Rated for Div. 2) ›

CF 1257D - Yet Another Monster Killing Problem

We are given a sequence of monsters that must be defeated strictly from left to right. Each monster has a required strength threshold, and none can be skipped or reordered. We also have a pool of heroes.
codeforces competitive-programming binary-search data-structures dp greedy sortings two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 76 (Rated for Div. 2) ›

CF 1257G - Divisor Set

The input does not give the number directly. Instead, it gives its prime factorization as a list of prime factors, where equal primes may appear many times. Suppose a prime $q$ appears $c$ times. Then every divisor chooses an exponent between $0$ and $c$ for that prime.
codeforces competitive-programming divide-and-conquer fft greedy math number-theory Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 76 (Rated for Div. 2) ›

CF 1257E - The Contest

We have three participants and a set of problems numbered from 1 to n. Each participant currently holds some subset of problems, but the subsets may not respect the desired division: the first participant should hold a prefix of the problems, the third participant should hold…
codeforces competitive-programming data-structures dp greedy Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 76 (Rated for Div. 2) ›

CF 1257A - Two Rival Students

We have a line of students numbered from 1 to n. Among them, two students are rivals, located at positions a and b. The gym teacher wants to maximize the distance between these two students, where distance is simply the absolute difference of their positions.
codeforces competitive-programming greedy math Jun 11, 2026