Codeforces Round 616 (Div. 2)

3 problems from Codeforces Round 616 (Div. 2) (contest 1291), difficulty 900-2800. 0/3 solutions verified against sample I/O.

3 items

Codeforces Round 616 (Div. 2)

Div. 2 | 3 problems | 0/3 verified | Difficulty 900-2800 | 15m 2s

#	Problem	Rating	Tags	Accepted	Time
A	Even But Not Even	900	greedy, math, strings	20,680	4m 55s
B	Array Sharpening	1300	greedy, implementation	15,358	5m 13s
F	Coffee Varieties (easy version)	2800	graphs, interactive	726	4m 54s

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

CF 1291B - Array Sharpening

We are given an array of non-negative integers. We are allowed to repeatedly decrease any element by 1 as long as it stays non-negative.

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

CF 1291A - Even But Not Even

We are given a digit string and we are allowed to delete some of its digits while keeping the remaining digits in the same relative order.

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

CF 1291F - Coffee Varieties (easy version)

We are given a hidden sequence of café types, where each café produces exactly one integer “coffee variety”. We do not know the sequence itself, but we can probe cafés one by one. The interaction tool behaves like a sliding-window memory system.