Educational Codeforces Round 84 (Rated for Div. 2)

3 problems from Educational Codeforces Round 84 (Rated for Div. 2) (contest 1327), difficulty 1100-2500. 1/3 solutions verified against sample I/O.

3 items

Educational Codeforces Round 84 (Rated for Div. 2)

Div. 2 | 3 problems | 1/3 verified | Difficulty 1100-2500 | 10m 27s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Sum of Odd Integers	1100	math	45,721	4m 16s
C	Game with Chips	1600	constructive-algorithms, implementation	14,086	2m 54s	✓
F	AND Segments	2500	bitmasks, combinatorics, data-structures	2,028	3m 17s

Practice › Codeforces Solutions › Educational Codeforces Round 84 (Rated for Div. 2) ›

CF 1327C - Game with Chips

We are given a grid of size $n times m$ with several chips placed on cells. Each chip can be moved simultaneously with all others by applying a single global move in one of four directions: up, down, left, or right.

Practice › Codeforces Solutions › Educational Codeforces Round 84 (Rated for Div. 2) ›

CF 1327F - AND Segments

We are building an array of length $n$, where each position stores an integer with at most $k$ bits. On top of that, we are given several constraints, each describing a segment $[l, r]$ and a required value for the bitwise AND of all elements in that segment.

Practice › Codeforces Solutions › Educational Codeforces Round 84 (Rated for Div. 2) ›

CF 1327A - Sum of Odd Integers

The problem asks whether a given integer n can be expressed as the sum of exactly k distinct positive odd integers. Each test case provides n and k, and the answer is either "YES" or "NO". Odd integers are numbers not divisible by 2, so valid candidates are 1, 3, 5, 7,....