Codeforces Round 1057 (Div. 2)

6 problems from Codeforces Round 1057 (Div. 2) (contest 2153), difficulty 800-2900. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 1057 (Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2900 | 15m 8s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Circle of Apple Trees	800	greedy, sortings	26,356	1m 30s	✓
B	Bitwise Reversion	800	bitmasks, greedy	22,582	1m 18s	✓
C	Symmetrical Polygons	1500	constructive-algorithms, geometry, greedy	11,767	1m 35s
D	Not Alone	1800	dp, greedy	6,287	3m 13s
E	Zero Trailing Factorial	2400	brute-force, math, number-theory	984	2m 18s
F	Odd Queries on Odd Array	2900	bitmasks, brute-force, data-structures	323	5m 14s

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

CF 2153F - Odd Queries on Odd Array

We are given an array a of length n that satisfies a special property called "cute," which prevents certain repeating patterns of four indices.

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

CF 2153D - Not Alone

We are given a circular sequence of integers, and we are allowed to change each value by paying unit cost per increment or decrement.

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

CF 2153E - Zero Trailing Factorial

We are asked to work with trailing zeros of factorials in arbitrary bases. Specifically, for any integer $xge 1$ and base $kge 2$, $vk(x!)$ counts how many times $k$ divides $x!$. For prime bases, this is straightforward: sum the integer divisions of $x$ by powers of $p$.

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

CF 2153C - Symmetrical Polygons

We are given several collections of stick lengths, and for each collection we want to pick some of these sticks to form the sides of a polygon. Each chosen stick becomes exactly one side, so we are not allowed to split or merge sticks.

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

CF 2153A - Circle of Apple Trees

We are given a circle of apple trees, each bearing a single apple with an associated beauty value. You start at tree one and walk around the circle repeatedly. At each tree, you have the choice to eat the apple or skip it.

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

CF 2153B - Bitwise Reversion

We are asked to determine whether it is possible to construct three non-negative integers, $a$, $b$, and $c$, such that their pairwise bitwise ANDs equal three given integers $x$, $y$, and $z$. Specifically, the constraints are that $a & b = x$, $b & c = y$, and $a & c = z$.