Codeforces Round 805 (Div. 3)

Solutions for Codeforces Round 805 (Div. 3) (contest 1702). 4/8 problems verified against sample I/O. Difficulty range: 800-2000.

8 items

Codeforces Round 805 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 4/8 | Rating range: 800-2000 | Time: 17m 26s

Problem Name Rating Tags Solve Time Verified
A Round Down the Price 800 constructive-algorithms 1m 54s ✓
B Polycarp Writes a String from Memory 800 greedy 1m 44s ✗
C Train and Queries 1100 data-structures, greedy 2m 37s ✓
D Not a Cheap String 1000 greedy 2m 28s ✗
E Split Into Two Sets 1600 dfs-and-similar, dsu, graphs 1m 57s ✓
F Equate Multisets 1700 constructive-algorithms, data-structures, greedy 2m 19s ✗
G1 Passable Paths (easy version) 1900 dfs-and-similar, trees 2m 35s ✓
G2 Passable Paths (hard version) 2000 data-structures, dfs-and-similar, trees 1m 52s ✗
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702G1 - Passable Paths (easy version)

We are given a tree and several queries. Each query specifies a set of vertices. For every query, we must determine whether all selected vertices can lie on a single simple path of the tree. A tree contains exactly one simple path between any two vertices.
codeforces competitive-programming dfs-and-similar trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702G2 - Passable Paths (hard version)

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 data-structures dfs-and-similar trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702F - Equate Multisets

We are given two collections of integers of the same size. Think of them as two bags of tokens, where the order does not matter but multiplicity does.
codeforces competitive-programming constructive-algorithms data-structures greedy math number-theory Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702D - Not a Cheap String

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 greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702E - Split Into Two Sets

We are given a collection of dominoes, each domino represented as a pair of integers between 1 and n, and the total number of dominoes n is even. The task is to split these dominoes into two groups so that within each group no number appears on more than one domino.
codeforces competitive-programming dfs-and-similar dsu graphs Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702C - Train and Queries

We are given a train route along stations with very large indices, from 1 to $10^9$. The train travels in the exact order of a list $u1, u2, dots, un$ and can revisit stations multiple times.
codeforces competitive-programming data-structures greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702A - Round Down the Price

Each test case gives the current price of an item. A "round" price is any power of ten: 1, 10, 100, 1000, and so on. We want to reduce the item's price until it becomes the largest round number that does not exceed the original price.
codeforces competitive-programming constructive-algorithms Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 805 (Div. 3) ›

CF 1702B - Polycarp Writes a String from Memory

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 greedy Jun 9, 2026