Codeforces Round 684 (Div. 2)

Solutions for Codeforces Round 684 (Div. 2) (contest 1440). 2/2 problems verified against sample I/O. Difficulty range: 800-900.

2 items

Codeforces Round 684 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-900 | Time: 2m 16s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Buy the String	800	implementation, math	1m 5s	✓
B	Sum of Medians	900	greedy, math	1m 11s	✓

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

CF 1440B - Sum of Medians

We are given a sorted list of $nk$ numbers and asked to split it into $k$ groups, each containing exactly $n$ elements.

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

CF 1440A - Buy the String

We are given a binary string and two ways to pay for it. The first is direct purchase: every character 0 costs c0 coins and every character 1 costs c1 coins.