Codeforces Round 835 (Div. 4)

Solutions for Codeforces Round 835 (Div. 4) (contest 1760). 4/7 problems verified against sample I/O. Difficulty range: 800-1700.

7 items

Codeforces Round 835 (Div. 4)

Type: Div. 4 | Problems: 7 | Verified: 4/7 | Rating range: 800-1700 | Time: 19m 2s

Problem Name Rating Tags Solve Time Verified
A Medium Number 800 implementation, sortings 3m 1s ✗
B Atilla's Favorite Problem 800 greedy, implementation, strings 3m 27s ✓
C Advantage 800 data-structures, implementation, sortings 2m 46s ✗
D Challenging Valleys 1000 implementation, two-pointers 2m 28s ✓
E Binary Inversions 1100 data-structures, greedy, math 2m 2s ✓
F Quests 1500 binary-search, greedy, sortings 3m 9s ✓
G SlavicG's Favorite Problem 1700 bitmasks, dfs-and-similar, graphs 2m 9s ✗
Practice › Codeforces Solutions › Codeforces Round 835 (Div. 4) ›

CF 1760G - SlavicG's Favorite Problem

We are working with a weighted tree where each edge contributes a bitwise XOR value when traversed. A walk starts at node a with an accumulated value x = 0. Every time we move along an edge, we update x by XORing it with that edge’s weight.
codeforces competitive-programming bitmasks dfs-and-similar graphs Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 835 (Div. 4) ›

CF 1760F - Quests

We have n quests. Quest i gives a[i] coins whenever it is completed. During d days we may perform at most one quest per day. After doing a quest, we must wait k days before doing that same quest again.
codeforces competitive-programming binary-search greedy sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 835 (Div. 4) ›

CF 1760D - Challenging Valleys

We are given an array of integers and need to determine whether it forms a "valley" according to a precise definition. Conceptually, a valley is a flat subarray that is lower than its neighbors on both sides.
codeforces competitive-programming implementation two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 835 (Div. 4) ›

CF 1760E - Binary Inversions

We are working with a binary sequence where inversions come only from pairs where a 1 appears before a 0. The task allows us to optionally flip a single element, and we want to maximize the total number of such inversions after that single modification.
codeforces competitive-programming data-structures greedy math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 835 (Div. 4) ›

CF 1760B - Atilla's Favorite Problem

We are given several lowercase strings. For each string, we want the smallest alphabet that contains every character appearing in that string. The alphabet is always a prefix of the English alphabet.
codeforces competitive-programming greedy implementation strings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 835 (Div. 4) ›

CF 1760A - Medium Number

The task is to determine the number that is neither the smallest nor the largest among three distinct integers. Each input case gives three numbers, and the output should identify the “middle” value.
codeforces competitive-programming implementation sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 835 (Div. 4) ›

CF 1760C - Advantage

We have a list of competitors, each with a numeric strength. For every competitor, we want to compute their advantage over the strongest opponent that is not themselves. Concretely, if the array of strengths is [s1, s2, ...
codeforces competitive-programming data-structures implementation sortings Jun 9, 2026