Codeforces Round 204 (Div. 1)

Solutions for Codeforces Round 204 (Div. 1) (contest 351). 1/2 problems verified against sample I/O. Difficulty range: 1800-2700.

2 items

Codeforces Round 204 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1800-2700 | Time: 4m 1s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Jeff and Rounding	1800	dp, greedy, implementation	1m 37s	✗
D	Jeff and Removing Periods	2700	data-structures	2m 24s	✓

Practice › Codeforces Solutions › Codeforces Round 204 (Div. 1) ›

CF 351A - Jeff and Rounding

We are given 2 n real numbers representing Jeff's birthday gifts. Jeff dislikes fractional numbers, so he performs n pairwise operations to "adjust" the numbers.

Practice › Codeforces Solutions › Codeforces Round 204 (Div. 1) ›

CF 351D - Jeff and Removing Periods

We are given a sequence of integers, and the task is to compute a "beauty" metric for any subsequence of it. The beauty is defined as the minimum number of operations needed to remove all elements, where each operation can remove a subsequence of equally spaced equal numbers.