Educational Codeforces Round 60 (Rated for Div. 2)

Solutions for Educational Codeforces Round 60 (Rated for Div. 2) (contest 1117). 3/7 problems verified against sample I/O. Difficulty range: 1000-2500.

7 items

Educational Codeforces Round 60 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 3/7 | Rating range: 1000-2500 | Time: 14m 48s

Problem Name Rating Tags Solve Time Verified
A Best Subsegment 1100 implementation, math 5m 30s ✗
B Emotes 1000 greedy, math, sortings 1m 28s ✓
C Magic Ship 1900 binary-search 1m 19s ✓
D Magic Gems 2100 dp, math, matrices 1m 24s ✗
E Decypher the String 2200 bitmasks, chinese-remainder-theorem, constructive-algorithms 1m 34s ✗
F Crisp String 2500 bitmasks, dp 2m 1s ✓
G Recursive Queries 2500 data-structures 1m 32s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 60 (Rated for Div. 2) ›

CF 1117A - Best Subsegment

We are given an array of integers and may choose any contiguous subarray. For every chosen subarray, we can compute its arithmetic mean, which is the sum of its elements divided by its length. The task is to find the maximum possible mean among all subarrays.
codeforces competitive-programming implementation math Jun 12, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 60 (Rated for Div. 2) ›

CF 1117F - Crisp String

We are given a string consisting of the first p letters of the lowercase English alphabet, and a symmetric adjacency matrix A that specifies which letters can appear next to each other. A string is crisp if every consecutive pair of letters in it is allowed by this matrix.
codeforces competitive-programming bitmasks dp Jun 12, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 60 (Rated for Div. 2) ›

CF 1117G - Recursive Queries

We are given a permutation of the numbers from 1 to n. Each query asks for a recursively defined function over a subarray. Specifically, for a range [l, r], we first find the position of the maximum element in that range.
codeforces competitive-programming data-structures Jun 12, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 60 (Rated for Div. 2) ›

CF 1117E - Decypher the String

We are given a string t of length n which is the result of applying an unknown sequence of swaps to an original string s. Each swap exchanges two characters at positions ai and bi in s.
codeforces competitive-programming bitmasks chinese-remainder-theorem constructive-algorithms interactive math Jun 12, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 60 (Rated for Div. 2) ›

CF 1117D - Magic Gems

We are counting ways to build a final sequence of unit-sized positions whose total length is exactly $N$. Each position can be either a normal gem or the result of splitting a magic gem.
codeforces competitive-programming dp math matrices Jun 12, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 60 (Rated for Div. 2) ›

CF 1117B - Emotes

We are given a set of emotes, each with a positive happiness value. We are allowed to use emotes a fixed number of times, but no single emote can be repeated more than a given number of times consecutively.
codeforces competitive-programming greedy math sortings Jun 12, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 60 (Rated for Div. 2) ›

CF 1117C - Magic Ship

We are given a starting point on an infinite grid and a target point. Each day, the environment produces a wind direction from a fixed periodic string. That wind shifts the ship by one unit in one of the four cardinal directions.
codeforces competitive-programming binary-search Jun 12, 2026