Codeforces Round 653 (Div. 3)

5 problems from Codeforces Round 653 (Div. 3) (contest 1374), difficulty 800-2500. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 653 (Div. 3)

Div. 3 | 5 problems | 2/5 verified | Difficulty 800-2500 | 14m 4s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Required Remainder	800	math	64,137	2m 15s
C	Move Brackets	1000	greedy, strings	63,887	1m 42s	✓
E1	Reading Books (easy version)	1600	data-structures, greedy, sortings	14,975	2m 55s	✓
E2	Reading Books (hard version)	2500	data-structures, greedy, implementation	1,073	1m 44s
F	Cyclic Shifts Sorting	2400	brute-force, constructive-algorithms, implementation	1,398	5m 28s

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

CF 1374F - Cyclic Shifts Sorting

We are given an array and a very specific primitive operation: we can pick any position and rotate a block of three consecutive elements to the right. That means a local triple [x, y, z] becomes [z, x, y].

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

CF 1374E1 - Reading Books (easy version)

We are given a collection of books, each with a reading time and two independent preference flags, one for Alice and one for Bob.

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

CF 1374E2 - Reading Books (hard version)

We are given a collection of books, where each book has a reading time and two independent preference flags, one for Alice and one for Bob. We must select exactly $m$ books. The chosen set is shared, so both of them read the same books together.

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

CF 1374A - Required Remainder

Let $Nge 1$ be fixed. An $m$-survivor is a positive integer all of whose prime factors exceed $m$. Let $$f(x,m)={nle x:text{$n$ is an $m$-survivor}},$$ and let $$fk(x,m)={nle x:text{$n$ is an $m$-survivor having exactly $k$ prime factors}},$$ where prime factors are counted…

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

CF 1374C - Move Brackets

We are given a string of brackets consisting of exactly half opening brackets '(' and half closing brackets ')', and our goal is to make it a valid, balanced bracket sequence.