Codeforces Round 953 (Div. 2)

Solutions for Codeforces Round 953 (Div. 2) (contest 1978). 1/6 problems verified against sample I/O. Difficulty range: 800-2400.

6 items

Codeforces Round 953 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2400 | Time: 13m 40s

Problem Name Rating Tags Solve Time Verified
A Alice and Books 800 constructive-algorithms, greedy, sortings 2m 26s ✗
B New Bakery 800 binary-search, greedy, math 2m 7s ✓
C Manhattan Permutations 1300 constructive-algorithms, data-structures, greedy 2m 33s ✗
D Elections 1600 data-structures, greedy, implementation 1m 38s ✗
E Computing Machine 2000 brute-force, data-structures, dp 2m 25s ✗
F Large Graph 2400 data-structures, dfs-and-similar, dsu 2m 31s ✗
Practice › Codeforces Solutions › Codeforces Round 953 (Div. 2) ›

CF 1978F - Large Graph

We are given an array of integers and asked to build a square matrix where each row is a cyclic right shift of the previous row. Then, we treat every element of the matrix as a vertex in a graph.
codeforces competitive-programming data-structures dfs-and-similar dsu graphs number-theory two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 953 (Div. 2) ›

CF 1978E - Computing Machine

We are given two binary strings s and t of length n. The strings consist of 0s and 1s. Sasha is interested in the following: for a given substring range [l, r], we consider substring a = s[l..r] and substring b = t[l..r].
codeforces competitive-programming brute-force data-structures dp greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 953 (Div. 2) ›

CF 1978D - Elections

Working
codeforces competitive-programming data-structures greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 953 (Div. 2) ›

CF 1978C - Manhattan Permutations

We are asked to construct a permutation of integers from $1$ to $n$ such that the sum of absolute differences between each element's value and its position equals a given number $k$.
codeforces competitive-programming constructive-algorithms data-structures greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 953 (Div. 2) ›

CF 1978A - Alice and Books

Alice has a stack of books, each with a certain number of pages. She wants to divide them into exactly two piles, making sure both piles are non-empty. From each pile, she will read the book with the most pages.
codeforces competitive-programming constructive-algorithms greedy sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 953 (Div. 2) ›

CF 1978B - New Bakery

In this problem, Bob is trying to maximize his profit from selling buns with a special promotion. He has n buns to sell, a usual price a for each bun, and a promotional parameter b.
codeforces competitive-programming binary-search greedy math ternary-search Jun 8, 2026