Codeforces Round 524 (Div. 2)

6 problems from Codeforces Round 524 (Div. 2) (contest 1080), difficulty 800-2400. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 524 (Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 800-2400 | 26m 36s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Petya and Origami	800	math	19,175	5m 14s	✓
B	Margarite and the best present	900	math	12,636	2m 38s	✓
C	Masha and two friends	1500	implementation	4,218	3m 5s	✓
D	Olya and magical square	2000	constructive-algorithms, implementation, math	1,666	7m 33s
E	Sonya and Matrix Beauty	2400	strings	1,312	5m 6s
F	Katya and Segments Sets	2400	data-structures, interactive, sortings	918	3m

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

CF 1080D - Olya and magical square

We start with a square grid whose side length is a power of two, specifically $2^n times 2^n$. The only allowed operation is to take any existing square of side $a$ and split it into four equal smaller squares of side $a/2$.

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

CF 1080E - Sonya and Matrix Beauty

We are given a grid of characters. From this grid we may choose any axis-aligned subrectangle, and we are allowed to reorder characters independently inside each row of that chosen subrectangle.

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

CF 1080F - Katya and Segments Sets

We are given several collections of segments, where each collection corresponds to a set index from 1 to n. Inside a single set, there may be many segments, and each segment is a closed interval on the number line. The task revolves around answering queries about a range of sets.

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

CF 1080A - Petya and Origami

Petya is preparing invitation cards for a party, and each invitation consumes a fixed amount of colored paper sheets. Every invitation requires 2 red sheets, 5 green sheets, and 8 blue sheets.

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

CF 1080C - Masha and two friends

We are working on a very large grid, conceptually a chessboard with $n$ rows and $m$ columns. Each cell initially has a color determined by a fixed chessboard pattern, alternating between black and white. Two paint operations are applied on top of this initial pattern.

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

CF 1080B - Margarite and the best present

We are given a very large infinite sequence where each position has a deterministic value based only on its index. The value alternates sign and grows in magnitude linearly: position 1 contributes −1, position 2 contributes +2, position 3 contributes −3, and so on.