Educational Codeforces Round 41 (Rated for Div. 2)

4 problems from Educational Codeforces Round 41 (Rated for Div. 2) (contest 961), difficulty 900-2700. 2/4 solutions verified against sample I/O.

4 items

Educational Codeforces Round 41 (Rated for Div. 2)

Div. 2 | 4 problems | 2/4 verified | Difficulty 900-2700 | 4m 42s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Tetris	900	implementation	10,850	1m 9s	✓
C	Chessboard	1400	bitmasks, brute-force, implementation	5,636	1m 22s	✓
F	k-substrings	2700	binary-search, hashing, string-suffix-structures	946	1m 46s
G	Partitions	2700	combinatorics, math, number-theory	1,611	25s

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

CF 961F - k-substrings

We are given a string $s$ of length $n$, and we consider all of its suffixes. For each starting position $k$, the corresponding substring is $s[k..n]$. The task is to analyze each of these suffixes independently.

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

CF 961G - Partitions

We are given $n$ weighted elements. Each element $i$ has a weight $wi$. We consider all ways to split these $n$ elements into exactly $k$ non-empty groups. Each such grouping is an unordered partition, so only the membership structure matters, not any labeling of groups.

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

CF 961C - Chessboard

We are given four separate square fragments of a chessboard, each fragment being an $n times n$ grid where every cell is already colored either black or white. The value $n$ is odd, and the goal is to assemble these four pieces into a larger $2n times 2n$ chessboard.

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

CF 961A - Tetris

We are simulating a process where squares arrive one by one and stack up in columns. There are n columns, and each incoming square chooses a column and lands on top of whatever is already there, increasing that column’s height by one.