Educational Codeforces Round 175 (Rated for Div. 2)

6 problems from Educational Codeforces Round 175 (Rated for Div. 2) (contest 2070), difficulty 800-3000. 5/6 solutions verified against sample I/O.

6 items

Educational Codeforces Round 175 (Rated for Div. 2)

Div. 2 | 6 problems | 5/6 verified | Difficulty 800-3000 | 9m 24s

# Problem Rating Tags Accepted Time ✓
A FizzBuzz Remixed 800 brute-force, math 26,490 1m 41s ✓
B Robot Program 1100 brute-force, implementation, math 19,686 1m 37s ✓
C Limited Repainting 1500 binary-search, greedy 13,817 1m 20s ✓
D Tree Jumps 1600 dfs-and-similar, dp, trees 11,097 1m 34s ✓
E Game with Binary String 2200 constructive-algorithms, data-structures, divide-and-conquer 1,854 1m 34s
F Friends and Pizza 3000 bitmasks, divide-and-conquer, dp 369 1m 38s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 175 (Rated for Div. 2) ›

CF 2070F - Friends and Pizza

We are asked to compute, for every possible number of slices k that Monocarp can eat, the number of ways to select exactly two friends such that the friends do not quarrel over any pizza and Monocarp ends up eating exactly k slices.
codeforces competitive-programming bitmasks divide-and-conquer dp fft Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 175 (Rated for Div. 2) ›

CF 2070E - Game with Binary String

We are given a binary string and we look at every contiguous substring. For each substring, a two-player game is played on the characters of that substring, where each move removes exactly two adjacent characters.
codeforces competitive-programming constructive-algorithms data-structures divide-and-conquer games greedy math Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 175 (Rated for Div. 2) ›

CF 2070D - Tree Jumps

We are asked to count the number of sequences of vertices in a rooted tree such that we can "jump" a chip along them according to specific rules. The tree has n vertices numbered from 1 to n with 1 as the root. Each vertex x has a distance dx from the root.
codeforces competitive-programming dfs-and-similar dp trees Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 175 (Rated for Div. 2) ›

CF 2070A - FizzBuzz Remixed

The problem asks us to count integers from 0 to n inclusive where the integer leaves the same remainder when divided by 3 and by 5. Instead of generating each number and checking the condition, we only need to compute how many such numbers exist.
codeforces competitive-programming brute-force math Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 175 (Rated for Div. 2) ›

CF 2070B - Robot Program

We are simulating a one-dimensional robot that moves along an integer line. The robot starts at position $x$, which can be negative or positive but is never zero initially.
codeforces competitive-programming brute-force implementation math Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 175 (Rated for Div. 2) ›

CF 2070C - Limited Repainting

We have a strip of n cells, all initially red. Each cell has a desired color after painting, either red or blue. We can perform at most k operations, each of which allows us to choose a consecutive segment of cells and paint them blue.
codeforces competitive-programming binary-search greedy Jun 8, 2026