Codeforces Round 615 (Div. 3)

4 problems from Codeforces Round 615 (Div. 3) (contest 1294), difficulty 800-2000. 3/4 solutions verified against sample I/O.

4 items

Codeforces Round 615 (Div. 3)

Div. 3 | 4 problems | 3/4 verified | Difficulty 800-2000 | 11m 4s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Collecting Coins	800	math	53,415	1m 49s	✓
C	Product of Three Numbers	1300	greedy, math, number-theory	46,245	2m 23s	✓
E	Obtain a Permutation	1900	greedy, implementation, math	5,177	1m 54s	✓
F	Three Paths on a Tree	2000	dfs-and-similar, dp, greedy	6,860	4m 58s

Practice › Codeforces Solutions › Codeforces Round 615 (Div. 3) ›

CF 1294F - Three Paths on a Tree

We are working with a tree, which means there is exactly one simple path between any two vertices. From this tree we must choose three distinct vertices, call them $a$, $b$, and $c$.

Practice › Codeforces Solutions › Codeforces Round 615 (Div. 3) ›

CF 1294E - Obtain a Permutation

We are given an $n times m$ matrix. The target matrix is completely fixed: row-major order from $1$ to $n cdot m$. The value that should end up in position $(r,c)$ is $$(r-1)cdot m + c.$$ We may perform two kinds of operations.

Practice › Codeforces Solutions › Codeforces Round 615 (Div. 3) ›

CF 1294C - Product of Three Numbers

For each test case, we are given a single integer n. We must determine whether n can be written as the product of three distinct integers a, b, and c, where each of them is at least 2. If such a decomposition exists, we print "YES" and one valid triple.

Practice › Codeforces Solutions › Codeforces Round 615 (Div. 3) ›

CF 1294A - Collecting Coins

We are asked to decide whether a given number of coins can be distributed among three sisters so that they all end up with the same total number of coins. Each sister already has some coins: Alice has a, Barbara has b, and Cerene has c.