Codeforces Round 696 (Div. 2)

Solutions for Codeforces Round 696 (Div. 2) (contest 1474). 2/6 problems verified against sample I/O. Difficulty range: 800-3000.

6 items

Codeforces Round 696 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-3000 | Time: 18m 43s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Puzzle From the Future	800	greedy	1m 59s	✓
B	Different Divisors	1000	binary-search, constructive-algorithms, greedy	2m 53s	✗
C	Array Destruction	1700	brute-force, constructive-algorithms, data-structures	4m 8s	✗
D	Cleaning	2200	data-structures, dp, greedy	1m 46s	✓
E	What Is It?	2500	constructive-algorithms, greedy	2m 56s	✗
F	1 2 3 4 ...	3000	dp, math, matrices	5m 1s	✗

Practice › Codeforces Solutions › Codeforces Round 696 (Div. 2) ›

CF 1474F - 1 2 3 4 ...

We are given a starting integer $x$ and a sequence of integers $d1, d2, dots, dn$. From these, we generate a new sequence $p$ by repeatedly adding or subtracting 1 from the last element, depending on the sign of $di$, and repeating this $ Because each $di$ can be as large as…

Practice › Codeforces Solutions › Codeforces Round 696 (Div. 2) ›

CF 1474E - What Is It?

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Codeforces Round 696 (Div. 2) ›

CF 1474C - Array Destruction

We are given an array of 2n positive integers, and our goal is to remove all elements by repeatedly selecting pairs whose sum equals a current number x. Initially, we can choose any positive integer x equal to the sum of two numbers in the array.

Practice › Codeforces Solutions › Codeforces Round 696 (Div. 2) ›

CF 1474D - Cleaning

We are given a line of stone piles, each pile containing some number of stones. The only allowed action removes stones in pairs: we pick two adjacent piles and delete one stone from each, as long as both piles are non-empty.

Practice › Codeforces Solutions › Codeforces Round 696 (Div. 2) ›

CF 1474B - Different Divisors

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Codeforces Round 696 (Div. 2) ›

CF 1474A - Puzzle From the Future

We are asked to construct a binary number a given another binary number b of the same length n in such a way that a derived number d is maximized. The process to obtain d is two-step. First, we compute c as the digit-wise sum of a and b without carrying.