Codeforces Round 654 (Div. 2)

6 problems from Codeforces Round 654 (Div. 2) (contest 1371), difficulty 800-2800. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 654 (Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 800-2800 | 16m 40s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Magical Sticks	800	math	51,247	1m 42s	✓
B	Magical Calendar	1200	math	19,608	1m 36s	✓
C	A Cookie for You	1300	greedy, implementation, math	21,367	3m 54s
E1	Asterism (Easy Version)	1900	binary-search, brute-force, combinatorics	5,527	1m 46s	✓
E2	Asterism (Hard Version)	2300	binary-search, combinatorics, dp	2,513	2m 23s	✓
F	Raging Thunder	2800	data-structures, divide-and-conquer, implementation	691	5m 19s

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

CF 1371F - Raging Thunder

We are given a line of positions, each containing a direction symbol that behaves like a deterministic local rule. From every starting position, a ball moves left or right according to its own symbol and the symbol of the neighbor it is interacting with.

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

CF 1371C - A Cookie for You

We are given two types of cookies and two types of guests. The cookies are split into vanilla and chocolate counts, and guests also come in two behavioral types.

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

CF 1371E2 - Asterism (Hard Version)

We are given a fixed list of enemy strengths, and we imagine choosing a starting number of candies $x$. For any such $x$, Yuzu faces all enemies in some order.

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

CF 1371E1 - Asterism (Easy Version)

We are asked to find all positive integers $x$ such that, if Yuzu starts with $x$ candies, there exists a number of ways to defeat all enemies in sequence (a permutation of enemies) so that she always has at least as many candies as her current opponent.

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

CF 1371A - Magical Sticks

We have a set of sticks with lengths from 1 to $n$, one stick of each length. Rocher can connect any two sticks to form a new stick whose length is the sum of the two, removing the original sticks in the process.

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

CF 1371B - Magical Calendar

We have a magical calendar where the length of a week is flexible: Alice can choose any integer $k$ from $1$ to $r$ to be the number of days in a week. Alice wants to paint $n$ consecutive days on this calendar.