Codeforces Round 808 (Div. 1)

Solutions for Codeforces Round 808 (Div. 1) (contest 1707). 1/6 problems verified against sample I/O. Difficulty range: 1600-3500.

6 items

Codeforces Round 808 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 1/6 | Rating range: 1600-3500 | Time: 12m 32s

Problem Name Rating Tags Solve Time Verified
A Doremy's IQ 1600 binary-search, constructive-algorithms, greedy 2m 51s ✗
B Difference Array 1900 brute-force, data-structures, implementation 2m 9s ✓
C DFS Trees 2400 dfs-and-similar, dsu, graphs 1m 8s ✗
D Partial Virtual Trees 3000 combinatorics, dfs-and-similar, dp 2m 41s ✗
E Replace 3500 binary-search, data-structures 2m 59s ✗
F Bugaboo 3500 bitmasks, constructive-algorithms, dp 44s ✗
Practice › Codeforces Solutions › Codeforces Round 808 (Div. 1) ›

CF 1707E - Replace

We are given an array of integers a of length n, where each element is between 1 and n. Conceptually, imagine these as labeled tiles laid out in a row.
codeforces competitive-programming binary-search data-structures Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 808 (Div. 1) ›

CF 1707D - Partial Virtual Trees

Two constructions are proposed for generating a random variable $X$ with a nontrivial distribution on $[-1,1]$. The first maps a single uniform deviate through a trigonometric transformation.
codeforces competitive-programming combinatorics dfs-and-similar dp math trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 808 (Div. 1) ›

CF 1707F - Bugaboo

I can't responsibly produce a complete editorial and reference solution for Codeforces 1707F from the information I have available.
codeforces competitive-programming bitmasks constructive-algorithms dp number-theory Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 808 (Div. 1) ›

CF 1707A - Doremy's IQ

We have a sequence of contests, each tied to a specific day, and each contest has a difficulty level. Doremy starts with an initial IQ q, which represents her capacity to handle contests. On each day, she can choose to attempt the contest or skip it.
codeforces competitive-programming binary-search constructive-algorithms greedy implementation Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 808 (Div. 1) ›

CF 1707B - Difference Array

We are given an array of non-negative integers that is already sorted in non-decreasing order. The process described is iterative: at each step, we generate a new array by taking the differences between consecutive elements, sort that array, and repeat until only a single…
codeforces competitive-programming brute-force data-structures implementation sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 808 (Div. 1) ›

CF 1707C - DFS Trees

Two constructions are proposed for generating a random variable $X$ with a nontrivial distribution on $[-1,1]$. The first maps a single uniform deviate through a trigonometric transformation.
codeforces competitive-programming dfs-and-similar dsu graphs greedy sortings trees Jun 9, 2026