Codeforces Round 642 (Div. 3)

Solutions for Codeforces Round 642 (Div. 3) (contest 1353). 3/3 problems verified against sample I/O. Difficulty range: 800-1900.

3 items

Codeforces Round 642 (Div. 3)

Type: Div. 3 | Problems: 3 | Verified: 3/3 | Rating range: 800-1900 | Time: 13m 23s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Most Unstable Array	800	constructive-algorithms, greedy, math	1m 46s	✓
B	Two Arrays And Swaps	800	greedy, sortings	9m 14s	✓
E	K-periodic Garland	1900	brute-force, dp, greedy	2m 23s	✓

Practice › Codeforces Solutions › Codeforces Round 642 (Div. 3) ›

CF 1353B - Two Arrays And Swaps

The problem gives two arrays of equal length, which we can think of as two sets of numbers on separate shelves. We are allowed to swap numbers between the shelves, but only up to a maximum of k swaps.

Practice › Codeforces Solutions › Codeforces Round 642 (Div. 3) ›

CF 1353E - K-periodic Garland

We are given a linear garland of lamps, represented as a string of 0s and 1s, where 1 indicates a lamp is on and 0 indicates it is off. A garland is called k-periodic if the distance between any two consecutive 1s is exactly k.

Practice › Codeforces Solutions › Codeforces Round 642 (Div. 3) ›

CF 1353A - Most Unstable Array

We are given an array length n and a required total sum m. The task is to assign non-negative integers to an array of length n so that the sum of all elements equals m.