Codeforces Round 559 (Div. 2)

Solutions for Codeforces Round 559 (Div. 2) (contest 1159). 2/2 problems verified against sample I/O. Difficulty range: 800-1300.

2 items

Codeforces Round 559 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1300 | Time: 4m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
A	A pile of stones	800	implementation, math	2m 37s	✓
B	Expansion coefficient of the array	1300	implementation, math	1m 30s	✓

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

CF 1159A - A pile of stones

We are given a sequence of operations applied to a single pile of stones. Each operation is either adding one stone or removing one stone.

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

CF 1159B - Expansion coefficient of the array

We are given an array of non-negative integers. We define a property called a $k$-extension: an array is a $k$-extension if for every pair of elements $ai$ and $aj$, the inequality $k cdot The input consists of the length $n$ of the array, up to 300,000, and the array elements…