Codeforces Round 776 (Div. 3)

Solutions for Codeforces Round 776 (Div. 3) (contest 1650). 2/7 problems verified against sample I/O. Difficulty range: 800-2200.

7 items

Codeforces Round 776 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 2/7 | Rating range: 800-2200 | Time: 15m 15s

Problem Name Rating Tags Solve Time Verified
A Deletions of Two Adjacent Letters 800 implementation, strings 3m 45s ✓
B DIV + MOD 900 math 1m 29s ✓
C Weight of the System of Nested Segments 1200 greedy, hashing, implementation 2m 35s ✗
D Twist the Permutation 1300 brute-force, constructive-algorithms, implementation 1m 33s ✗
E Rescheduling the Exam 1900 binary-search, data-structures, greedy 1m 46s ✗
F Vitaly and Advanced Useless Algorithms 2200 dp, greedy, implementation 2m 36s ✗
G Counting Shortcuts 2100 data-structures, dfs-and-similar, dp 1m 31s ✗
Practice › Codeforces Solutions › Codeforces Round 776 (Div. 3) ›

CF 1650F - Vitaly and Advanced Useless Algorithms

We have a sequence of course assignments whose deadlines are already sorted. Assignment i must be fully completed by absolute time a[i]. Initially every assignment has 0% progress. There are m available training options. Option j belongs to exactly one assignment e[j].
codeforces competitive-programming dp greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 776 (Div. 3) ›

CF 1650G - Counting Shortcuts

We are asked to count paths in an undirected graph from a start vertex s to a target t whose lengths are either exactly the shortest distance or exceed it by at most one. The graph has n vertices and m edges, with no loops or multiple edges.
codeforces competitive-programming data-structures dfs-and-similar dp graphs shortest-paths Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 776 (Div. 3) ›

CF 1650E - Rescheduling the Exam

We are given a sequence of exam days for Dmitry, each day numbered from 1 to $d$. He can rest some days before each exam, and the key measure of schedule quality is $mu$, the minimum rest between consecutive exams (or between the start of the session and the first exam).
codeforces competitive-programming binary-search data-structures greedy implementation math sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 776 (Div. 3) ›

CF 1650A - Deletions of Two Adjacent Letters

We are given a string of odd length and a target character. The string can be shortened repeatedly by removing any two adjacent characters at a time. The question is whether it is possible to perform a sequence of such deletions so that only the target character remains.
codeforces competitive-programming implementation strings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 776 (Div. 3) ›

CF 1650D - Twist the Permutation

We are given a permutation of numbers from $1$ to $n$, initially in increasing order. Petya performed $n$ operations to transform it. In the $i$-th operation, he cyclically shifted the first $i$ elements any number of times to the right.
codeforces competitive-programming brute-force constructive-algorithms implementation math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 776 (Div. 3) ›

CF 1650C - Weight of the System of Nested Segments

We are given points on a number line. Every point has a coordinate and a weight. We want to choose exactly $2n$ of these points and use them as endpoints of $n$ segments. The segments must form a perfectly nested structure.
codeforces competitive-programming greedy hashing implementation sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 776 (Div. 3) ›

CF 1650B - DIV + MOD

We are asked to maximize a function defined as $fa(x) = lfloor x / a rfloor + (x bmod a)$ over a range of integers from $l$ to $r$, where $a$ is a fixed positive integer.
codeforces competitive-programming math Jun 10, 2026