Codeforces Beta Round 11

5 problems from Codeforces Beta Round 11 (contest 11), difficulty 900-2800. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 11

Beta | 5 problems | 5/5 verified | Difficulty 900-2800 | 8m 46s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Increasing Sequence	900	constructive-algorithms, implementation, math	15,491	1m 24s	✓
B	Jumping Jack	1600	math	5,706	1m 26s	✓
C	How Many Squares?	2200	implementation	691	2m 42s	✓
D	A Simple Task	2200	bitmasks, dp, graphs	6,382	1m 29s	✓
E	Forward, march!	2800	binary-search, dp, greedy	439	1m 45s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 11 ›

CF 11A - Increasing Sequence

We have an array of integers, and we want every element to become strictly larger than the one before it. The only operation allowed is choosing a single element and increasing it by exactly d. Every use of this operation counts as one move.

Practice › Codeforces Solutions › Codeforces Beta Round 11 ›

CF 11B - Jumping Jack

Jack starts at position 0 on a number line. His jumps have fixed lengths: the first jump must have length 1, the second jump length 2, the third jump length 3, and so on. For every jump he may choose either direction.

Practice › Codeforces Solutions › Codeforces Beta Round 11 ›

CF 11C - How Many Squares?

We are given a binary grid. A valid object is not a filled square, it is only the border of a square drawn with 1s. Every cell not belonging to the border must be 0.

Practice › Codeforces Solutions › Codeforces Beta Round 11 ›

CF 11D - A Simple Task

We are asked to count the number of simple cycles in an undirected graph. A simple cycle is a closed loop where no vertex or edge is repeated.

Practice › Codeforces Solutions › Codeforces Beta Round 11 ›

CF 11E - Forward, march!

Jack repeats a cyclic sequence consisting of three possible actions. L means a left-foot step, R means a right-foot step, and X means standing still for one beat. The sergeant expects the infinite alternating pattern: