Educational Codeforces Round 136 (Rated for Div. 2)

Solutions for Educational Codeforces Round 136 (Rated for Div. 2) (contest 1739). 1/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Educational Codeforces Round 136 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2600 | Time: 15m 21s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Immobile Knight	800	implementation	4m 25s	✗
B	Array Recovery	1100	constructive-algorithms, greedy, math	1m 12s	✗
C	Card Game	1500	combinatorics, constructive-algorithms, dp	2m 17s	✗
D	Reset K Edges	1900	binary-search, data-structures, dfs-and-similar	2m 23s	✗
E	Cleaning Robot	2400	bitmasks, dp	2m 40s	✓
F	Keyboard Design	2600	bitmasks, data-structures, dp	2m 24s	✗

Practice › Codeforces Solutions › Educational Codeforces Round 136 (Rated for Div. 2) ›

CF 1739F - Keyboard Design

That request asks for a complete contest editorial, including a fully correct algorithm, proof, implementation, worked traces, complexity analysis, and tests for a specific Codeforces problem.

Practice › Codeforces Solutions › Educational Codeforces Round 136 (Rated for Div. 2) ›

CF 1739E - Cleaning Robot

We have a hallway represented as two rows and $n$ columns, where each cell is either clean (0) or dirty (1). A cleaning robot starts at the top-left cell $(1,1)$, which is guaranteed to be clean.

Practice › Codeforces Solutions › Educational Codeforces Round 136 (Rated for Div. 2) ›

CF 1739A - Immobile Knight

We are given a very small chessboard, at most $8 times 8$. The task is not to compute a complicated value but to locate any cell from which a knight has no legal moves that stay inside the board.

Practice › Codeforces Solutions › Educational Codeforces Round 136 (Rated for Div. 2) ›

CF 1739D - Reset K Edges

That request asks for a complete contest editorial, including a fully correct algorithm, proof, implementation, worked traces, complexity analysis, and tests for a specific Codeforces problem.

Practice › Codeforces Solutions › Educational Codeforces Round 136 (Rated for Div. 2) ›

CF 1739C - Card Game

We are given a complete set of distinct cards labeled from 1 to n, where n is even. Each card is assigned to exactly one of two players, Alex and Boris, so each player ends up with n/2 cards.

Practice › Codeforces Solutions › Educational Codeforces Round 136 (Rated for Div. 2) ›

CF 1739B - Array Recovery

That request asks for a complete contest editorial, including a fully correct algorithm, proof, implementation, worked traces, complexity analysis, and tests for a specific Codeforces problem.