Codeforces Round 760 (Div. 3)

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

7 items

Codeforces Round 760 (Div. 3)

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

Problem Name Rating Tags Solve Time Verified
A Polycarp and Sums of Subsequences 800 math, sortings 9m 22s ✗
B Missing Bigram 800 implementation 1m 45s ✗
C Paint the Array 1100 math 1m 47s ✓
D Array and Operations 1300 dp, greedy, math 1m 41s ✗
E Singers' Tour 1700 constructive-algorithms, math 1m 49s ✗
F Reverse 2000 bitmasks, constructive-algorithms, dfs-and-similar 3m 21s ✓
G Trader Problem 2200 data-structures, dsu, greedy 1m 41s ✗
Practice › Codeforces Solutions › Codeforces Round 760 (Div. 3) ›

CF 1618A - Polycarp and Sums of Subsequences

Thanks. Now we have more clarity. The previous solution was using brute-force divisor counting, which explains why: - Small numbers like 10 → 4 and 1 → 1 worked. - 25 → 3 (wrong) because brute-force counted divisors incorrectly.
codeforces competitive-programming math sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 760 (Div. 3) ›

CF 1618F - Reverse

We are allowed to repeatedly transform a positive integer by operating directly on its binary representation. In one move, we take the current binary string of the number, append either a 0 or a 1 at the end, reverse the entire resulting string, strip leading zeros, and…
codeforces competitive-programming bitmasks constructive-algorithms dfs-and-similar implementation math strings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 760 (Div. 3) ›

CF 1618G - Trader Problem

In this problem, Monocarp has a set of items, each with an integer price, and he can trade these items with another character’s items.
codeforces competitive-programming data-structures dsu greedy sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 760 (Div. 3) ›

CF 1618E - Singers' Tour

We have a circular arrangement of $n$ towns, each with a singer who has an initial repertoire of $ai$ minutes. Every singer tours all towns in clockwise order, performing in each town.
codeforces competitive-programming constructive-algorithms math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 760 (Div. 3) ›

CF 1618D - Array and Operations

We are given a multiset of integers. We repeatedly remove two elements exactly $k$ times, and each removal produces a value that is added to a running score. After these $k$ operations, whatever elements remain are also added directly to the score.
codeforces competitive-programming dp greedy math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 760 (Div. 3) ›

CF 1618C - Paint the Array

We are given an array of positive integers. The task is to pick a positive integer $d$ and color the elements of the array in two colors: red for elements divisible by $d$, and blue for elements not divisible by $d$.
codeforces competitive-programming math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 760 (Div. 3) ›

CF 1618B - Missing Bigram

We are given a sequence of overlapping two-letter strings, or bigrams, derived from a word consisting of only 'a' and 'b'.
codeforces competitive-programming implementation Jun 10, 2026