Codeforces Round 588 (Div. 2)

2 problems from Codeforces Round 588 (Div. 2) (contest 1230), difficulty 800-1000. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 588 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1000 | 6m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dawid and Bags of Candies	800	brute-force, implementation	22,919	3m 33s	✓
B	Ania and Minimizing	1000	greedy, implementation	19,630	3m 19s	✓

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

CF 1230B - Ania and Minimizing

We are given a very large decimal string representing a number with exactly n digits. We are allowed to change at most k of these digits, one position at a time, replacing a digit with any other digit from 0 to 9.

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

CF 1230A - Dawid and Bags of Candies

We are given four separate bags, each containing some number of candies. Each bag is indivisible and must be given entirely to exactly one of two friends.