Educational Codeforces Round 113 (Rated for Div. 2)

Solutions for Educational Codeforces Round 113 (Rated for Div. 2) (contest 1569). 2/6 problems verified against sample I/O. Difficulty range: 800-3000.

6 items

Educational Codeforces Round 113 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-3000 | Time: 19m 21s

Problem Name Rating Tags Solve Time Verified
A Balanced Substring 800 implementation 2m 47s ✗
B Chess Tournament 1000 constructive-algorithms 2m 4s ✗
C Jury Meeting 1500 combinatorics, math 8m 39s ✓
D Inconvenient Pairs 1900 binary-search, data-structures, implementation 2m 17s ✗
E Playoff Restoration 2600 bitmasks, brute-force, hashing 2m 16s ✗
F Palindromic Hamiltonian Path 3000 brute-force, dfs-and-similar, dp 1m 18s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 113 (Rated for Div. 2) ›

CF 1569C - Jury Meeting

We are asked to count the number of permutations of jury members that are “nice,” given how they present their tasks. Each jury member $i$ has $ai$ tasks, and they tell tasks in order according to a permutation.
codeforces competitive-programming combinatorics math Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 113 (Rated for Div. 2) ›

CF 1569F - Palindromic Hamiltonian Path

We are given a small undirected graph with at most 12 vertices. We want to assign each vertex a letter from a fixed alphabet of size k. Every such assignment produces a labeled graph.
codeforces competitive-programming brute-force dfs-and-similar dp graphs hashing Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 113 (Rated for Div. 2) ›

CF 1569E - Playoff Restoration

We are given a single-elimination tournament with $2^k$ teams, where $k$ ranges from 1 to 5. The matches are structured in a fixed bracket: in the first round, consecutive teams play each other, and winners advance to the next round, pairing up according to the same rule until…
codeforces competitive-programming bitmasks brute-force hashing implementation meet-in-the-middle Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 113 (Rated for Div. 2) ›

CF 1569D - Inconvenient Pairs

We are asked to count the number of "inconvenient pairs" among people located on the streets of a city that is a perfect square grid. Each person is guaranteed to be on either a vertical or a horizontal street, which are given as sorted coordinates.
codeforces competitive-programming binary-search data-structures implementation sortings two-pointers Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 113 (Rated for Div. 2) ›

CF 1569A - Balanced Substring

We are given a binary string consisting only of the characters a and b. For each test case, we must find any contiguous segment whose number of a characters is exactly equal to its number of b characters.
codeforces competitive-programming implementation Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 113 (Rated for Div. 2) ›

CF 1569B - Chess Tournament

We are given a group of players where every pair plays a single chess game. For each match, we must decide one of three outcomes: one player wins and the other loses, or both draw.
codeforces competitive-programming constructive-algorithms Jun 10, 2026