Educational Codeforces Round 99 (Rated for Div. 2)

Solutions for Educational Codeforces Round 99 (Rated for Div. 2) (contest 1455). 0/7 problems verified against sample I/O. Difficulty range: 800-2900.

7 items

Educational Codeforces Round 99 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 0/7 | Rating range: 800-2900 | Time: 18m 2s

Problem Name Rating Tags Solve Time Verified
A Strange Functions 800 math, number-theory 2m 34s ✗
B Jumps 1200 constructive-algorithms, math 1m 32s ✗
C Ping-pong 1100 constructive-algorithms, games, math 1m 57s ✗
D Sequence and Swaps 1600 dp, greedy, sortings 6m 35s ✗
E Four Points 2400 brute-force, constructive-algorithms, flows 1m 49s ✗
F String and Operations 2800 dp, greedy 1m 41s ✗
G Forbidden Value 2900 data-structures, dp 1m 54s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 99 (Rated for Div. 2) ›

CF 1455D - Sequence and Swaps

The error you are seeing: is not about the algorithm. Python is telling you that there is no function called solve defined in your code. This is a purely structural/typo issue: you cannot call a function that has not been defined yet. The root causes usually are: 1.
codeforces competitive-programming dp greedy sortings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 99 (Rated for Div. 2) ›

CF 1455G - Forbidden Value

The task is to simulate a simplified programming language where a single variable x can be assigned values through set instructions.
codeforces competitive-programming data-structures dp Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 99 (Rated for Div. 2) ›

CF 1455F - String and Operations

We are given a string s of length n whose characters are restricted to the first k lowercase letters of the Latin alphabet. For each character in s, we can perform one operation, and each operation must be applied exactly once in the order of the original positions.
codeforces competitive-programming dp greedy Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 99 (Rated for Div. 2) ›

CF 1455E - Four Points

We are given four distinct points on a 2D integer grid and can move any point by one unit in either the x or y direction per move. The goal is to transform these points into the vertices of an axis-aligned square using the minimum total number of moves.
codeforces competitive-programming brute-force constructive-algorithms flows geometry greedy implementation math ternary-search Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 99 (Rated for Div. 2) ›

CF 1455A - Strange Functions

The proposed solution correctly identifies the probability requested: the probability that a single subtract-and-shift cycle produces an odd value $w$ in the range $[2^n,2^{n+1})$ while the other argument remains in $Omega$.
codeforces competitive-programming math number-theory Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 99 (Rated for Div. 2) ›

CF 1455C - Ping-pong

We are simulating a ping-pong game where two players, Alice and Bob, have finite stamina. Each action, whether serving or returning, costs 1 stamina. Alice always serves first.
codeforces competitive-programming constructive-algorithms games math Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 99 (Rated for Div. 2) ›

CF 1455B - Jumps

We start at position 0 on a number line and want to reach a positive integer x. We perform jumps one by one, and the k-th jump has a special rule: it either moves us forward by k units or backward by 1 unit.
codeforces competitive-programming constructive-algorithms math Jun 11, 2026