Codeforces Round 757 (Div. 2)

Solutions for Codeforces Round 757 (Div. 2) (contest 1614). 2/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Codeforces Round 757 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2600 | Time: 14m 48s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Divan and a Store	800	brute-force, constructive-algorithms, greedy	1m 17s	✓
B	Divan and a New Project	1000	constructive-algorithms, sortings	6m 42s	✗
C	Divan and bitwise operations	1500	bitmasks, combinatorics, constructive-algorithms	1m 51s	✓
D1	Divan and Kostomuksha (easy version)	2100	dp, number-theory	1m 35s	✗
D2	Divan and Kostomuksha (hard version)	2300	dp, number-theory	1m 26s	✗
E	Divan and a Cottage	2600	binary-search, data-structures	1m 57s	✗

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

CF 1614B - Divan and a New Project

- a = [3,1,4,9,2,5,6] - The edges form a path: 1→2→3→4→5→6→7 - res = a[:] = [3,1,4,9,2,5,6] - Process topologically: 1. Node 1 → Node 2: res[1] = min(1,3) = 1 OK 2.

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

CF 1614E - Divan and a Cottage

We are asked to simulate the evolution of the temperature inside Divan's cottage over a sequence of days, where the temperature adjusts by one unit per day towards the outside temperature.

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

CF 1614D2 - Divan and Kostomuksha (hard version)

We are given a multiset of positive integers and allowed to permute them in any order. After choosing an order, we repeatedly take prefixes of this order and compute the gcd of each prefix, then sum all those gcd values.

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

CF 1614D1 - Divan and Kostomuksha (easy version)

We are given a list of positive integers, and we are allowed to reorder them arbitrarily. After fixing an order, we look at all prefixes of this order.

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

CF 1614C - Divan and bitwise operations

We are asked to reconstruct the sum of XORs over all non-empty subsequences of an array, knowing only the bitwise OR of several contiguous segments of that array. Each array element appears in at least one segment, so every element contributes to the OR values we are given.

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

CF 1614A - Divan and a Store

Divan wants to buy chocolate bars under three constraints: he only considers bars within a price range [l, r], and he cannot exceed his total budget k.