Codeforces Round 466 (Div. 2)

3 problems from Codeforces Round 466 (Div. 2) (contest 940), difficulty 1200-2000. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 466 (Div. 2)

Div. 2 | 3 problems | 3/3 verified | Difficulty 1200-2000 | 5m 58s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Points on the line	1200	brute-force, greedy, sortings	8,815	3m 1s	✓
B	Our Tanya is Crying Out Loud	1400	dp, greedy	9,505	1m 11s	✓
E	Cashback	2000	data-structures, dp, greedy	4,390	1m 46s	✓

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

CF 940A - Points on the line

We are given several points placed on a number line. Each point is just a single integer coordinate. We want to keep a subset of these points such that the spread of the remaining points is controlled, specifically the difference between the largest and smallest kept point…

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

CF 940E - Cashback

We are given a sequence of numbers, and we need to break it into contiguous segments. Each segment is evaluated independently, and then we sum up the segment scores.

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

CF 940B - Our Tanya is Crying Out Loud

We start with a single integer value x = n and repeatedly transform it until it becomes 1. Each move either reduces the value by one at a fixed cost A, or divides the current value by k at cost B, but division is only allowed when the current value is exactly divisible by k.