Codeforces Round 560 (Div. 3)

Solutions for Codeforces Round 560 (Div. 3) (contest 1165). 5/7 problems verified against sample I/O. Difficulty range: 1000-2000.

7 items

Codeforces Round 560 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 5/7 | Rating range: 1000-2000 | Time: 26m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Remainder	1100	implementation, math	1m 29s	✓
B	Polycarp Training	1000	data-structures, greedy, sortings	1m 25s	✗
C	Good String	1300	greedy	4m 3s	✓
D	Almost All Divisors	1600	math, number-theory	6m 29s	✓
E	Two Arrays and Sum of Functions	1600	greedy, math, sortings	1m 43s	✓
F1	Microtransactions (easy version)	2000	binary-search, greedy	3m 5s	✓
F2	Microtransactions (hard version)	2000	binary-search, greedy, implementation	8m 14s	✗

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

CF 1165F2 - Microtransactions (hard version)

Ivan needs to buy a fixed multiset of items, split into types, where each type requires a certain number of copies. Each day he earns exactly one unit of currency, and he can spend it immediately to buy items in the evening of the same day or save it for later.

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

CF 1165D - Almost All Divisors

We are given a multiset that is supposed to represent almost all divisors of some unknown integer $x$. “Almost all” here has a precise meaning: the list contains every divisor of $x$ except $1$ and $x$ itself.

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

CF 1165F1 - Microtransactions (easy version)

Ivan needs to acquire a collection of items, where each item belongs to one of several types. For each type, he must buy an exact required quantity.

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

CF 1165B - Polycarp Training

We are given a list of contests, each with a certain number of problems. Polycarp trains day by day, and on day $k$, he must pick exactly one unused contest and solve exactly $k$ problems from it.

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

CF 1165C - Good String

We are asked to transform a given string into a "good string" with the minimum number of deletions. A string is good if its length is even, and every pair of consecutive characters at positions (1,2), (3,4), etc., are different.

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

CF 1165E - Two Arrays and Sum of Functions

We are given two arrays of equal length, where one array is fixed and the other can be permuted arbitrarily. After choosing an ordering of the second array, we assign its values position by position against the first array.

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

CF 1165A - Remainder

We are given a binary string of length $n$, where each position behaves like a digit in a decimal number but is restricted to either 0 or 1. We are allowed to flip any digit as many times as we want, and each flip costs one operation.