Educational Codeforces Round 94 (Rated for Div. 2)

7 problems from Educational Codeforces Round 94 (Rated for Div. 2) (contest 1400), difficulty 800-2800. 4/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 94 (Rated for Div. 2)

Div. 2 | 7 problems | 4/7 verified | Difficulty 800-2800 | 19m 23s

# Problem Rating Tags Accepted Time ✓
A String Similarity 800 constructive-algorithms, strings 27,967 4m 54s
B RPG Protagonist 1700 brute-force, greedy, math 11,694 7m 4s
C Binary String Reconstruction 1500 2-sat, brute-force, constructive-algorithms 18,503 1m 26s ✓
D Zigzags 1900 brute-force, combinatorics, data-structures 11,391 1m 26s ✓
E Clear the Multiset 2200 data-structures, divide-and-conquer, dp 6,307 1m 45s ✓
F x-prime Substrings 2800 brute-force, dfs-and-similar, dp 1,164 1m 28s
G Mercenaries 2600 bitmasks, brute-force, combinatorics 1,160 1m 20s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 94 (Rated for Div. 2) ›

CF 1400B - RPG Protagonist

We are given a fixed amount of carrying capacity split between two people, you and your follower. Each test case describes a small “loot selection” problem: there are two types of weapons, swords and war axes, each type having a fixed weight per item and a limited stock in…
codeforces competitive-programming brute-force greedy math Jun 14, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 94 (Rated for Div. 2) ›

CF 1400A - String Similarity

We are given a binary string s of length 2n - 1. From this string, we look at every contiguous window of length n. There are exactly n such windows, starting at positions 1 through n. Each window represents a candidate string that overlaps heavily with its neighbors.
codeforces competitive-programming constructive-algorithms strings Jun 14, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 94 (Rated for Div. 2) ›

CF 1400E - Clear the Multiset

We are given a multiset of integers from 1 to n, where the count of integer i is ai. Our goal is to completely remove all elements from the multiset using two types of operations.
codeforces competitive-programming data-structures divide-and-conquer dp greedy Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 94 (Rated for Div. 2) ›

CF 1400G - Mercenaries

Polycarp wants to select a subset of mercenaries from a pool of n individuals. Each mercenary has two constraints: the minimum and maximum size of the team they are willing to join, given by li and ri.
codeforces competitive-programming bitmasks brute-force combinatorics dp dsu math two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 94 (Rated for Div. 2) ›

CF 1400F - x-prime Substrings

We are given a digit string and a small integer $x$. Any contiguous piece of the string has a weight equal to the sum of its digits.
codeforces competitive-programming brute-force dfs-and-similar dp string-suffix-structures strings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 94 (Rated for Div. 2) ›

CF 1400D - Zigzags

We are given an array of integers and asked to count how many quadruples of indices $(i, j, k, l)$ satisfy both $i < j < k < l$ and $a[i] = a[k]$, $a[j] = a[l]$.
codeforces competitive-programming brute-force combinatorics data-structures math two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 94 (Rated for Div. 2) ›

CF 1400C - Binary String Reconstruction

We are given a binary string $s$ and a distance parameter $x$. There exists an unknown original binary string $w$ of the same length.
codeforces competitive-programming 2-sat brute-force constructive-algorithms greedy Jun 11, 2026