Codeforces Beta Round 39

5 problems from Codeforces Beta Round 39 (contest 40), difficulty 1300-2600. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 39

Beta | 5 problems | 5/5 verified | Difficulty 1300-2600 | 7m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Find Color	1300	constructive-algorithms, geometry, implementation	4,433	1m 24s	✓
B	Repaintings	1600	math	1,397	1m 44s	✓
C	Berland Square	2300	implementation, math	326	1m 38s	✓
D	Interesting Sequence	2600	math	170	1m 55s	✓
E	Number Table	2500	combinatorics	810	1m 10s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40A - Find Color

The plane is colored using concentric rings centered at the origin. Every ring between two consecutive integer distances alternates color. The borders themselves, meaning all points whose distance from the origin is an integer, are always black.

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40B - Repaintings

We start with an n × m chessboard. The top-left cell is black, so the coloring alternates exactly like a normal chessboard. Only the initially black cells participate in the repainting process.

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40C - Berland Square

We have two families of circles on the infinite plane.

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40D - Interesting Sequence

The sequence starts with two fixed values:

Practice › Codeforces Solutions › Codeforces Beta Round 39 ›

CF 40E - Number Table

We are given a table representing the economy of Berland over n days and m months. Each cell in the table contains either 1 or -1, indicating a profit or a loss for that day of that month.