Codeforces Round 792 (Div. 1 + Div. 2)

Solutions for Codeforces Round 792 (Div. 1 + Div. 2) (contest 1684). 2/8 problems verified against sample I/O. Difficulty range: 800-3400.

8 items

Codeforces Round 792 (Div. 1 + Div. 2)

Type: Div. 1+2 | Problems: 8 | Verified: 2/8 | Rating range: 800-3400 | Time: 16m 54s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Digit Minimization	800	constructive-algorithms, games, math	1m 57s	✓
B	Z mod X = C	800	constructive-algorithms, math	2m 10s	✗
C	Column Swapping	1400	brute-force, constructive-algorithms, greedy	2m	✓
D	Traps	1700	constructive-algorithms, greedy, sortings	2m 33s	✗
E	MEX vs DIFF	2100	binary-search, brute-force, constructive-algorithms	2m 12s	✗
F	Diverse Segments	2600	data-structures, two-pointers	2m 11s	✗
G	Euclid Guess	2800	constructive-algorithms, flows, graph-matchings	1m 3s	✗
H	Hard Cut	3400	constructive-algorithms, dfs-and-similar, divide-and-conquer	2m 48s	✗

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684H - Hard Cut

We are given a binary string, which is a sequence of '0's and '1's. Our task is to partition this string into contiguous substrings in such a way that, if we interpret each substring as a binary number and sum them all, the result is a power of two.

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684G - Euclid Guess

We are given a multiset of positive integers, and we are told that this multiset was produced by repeatedly running Euclid’s algorithm on several unknown integer pairs.

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684D - Traps

We are given a sequence of traps, each with a base damage value. We traverse the traps in order, and for each trap we either take its damage or skip it by jumping over it.

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684F - Diverse Segments

We are given an array and several queries, where each query describes a segment of indices. The requirement is that inside every given query segment, all values must be pairwise distinct. If the array already satisfies this condition for all segments, we do nothing.

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684E - MEX vs DIFF

We are given an array of non-negative integers and we are allowed to perform up to k replacements, where each replacement changes any element to any non-negative value. After these edits, we evaluate the array using two quantities.

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684B - Z mod X = C

We are asked to construct three positive integers $x, y, z$ given three constraints on remainders. Each constraint relates one number to another through a modulo operation: the remainder when dividing $x$ by $y$ must equal $a$, the remainder when dividing $y$ by $z$ must equal…

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684C - Column Swapping

We are given a matrix where each row represents a sequence of numbers arranged across columns. The goal is to make every row individually non-decreasing from left to right, but we are only allowed a single global operation: swap two entire columns.

Practice › Codeforces Solutions › Codeforces Round 792 (Div. 1 + Div. 2) ›

CF 1684A - Digit Minimization

We are given an integer with no zero digits, and two players, Alice and Bob, play a turn-based game on its digits. Alice always moves first and can swap any two digits at different positions. Bob always removes the last digit of the number.