Codeforces Round 747 (Div. 2)

Solutions for Codeforces Round 747 (Div. 2) (contest 1594). 3/7 problems verified against sample I/O. Difficulty range: 800-2400.

7 items

Codeforces Round 747 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 3/7 | Rating range: 800-2400 | Time: 18m 8s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Consecutive Sum Riddle	800	math	1m 55s	✗
B	Special Numbers	1100	bitmasks, math	1m 16s	✓
C	Make Them Equal	1200	brute-force, greedy, math	8m 24s	✗
D	The Number of Imposters	1700	constructive-algorithms, dfs-and-similar, dp	1m 39s	✗
E1	Rubik's Cube Coloring (easy version)	1300	combinatorics, math	1m 26s	✓
E2	Rubik's Cube Coloring (hard version)	2300	brute-force, dp, implementation	1m 47s	✗
F	Ideal Farm	2400	constructive-algorithms, math	1m 41s	✓

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

CF 1594C - Make Them Equal

The reason your previous solution produces no output is usually fast I/O issues with sys.stdin.readline when reading multiple lines. In the sample input, after reading n, we must read exactly n lines for the students.

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

CF 1594F - Ideal Farm

We are asked to determine whether a farm with s animals and n pens is "ideal." A farm is ideal if, no matter how the animals are distributed across pens without leaving any pen empty, there exists some contiguous segment of pens that contains exactly k animals.

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

CF 1594E2 - Rubik's Cube Coloring (hard version)

We are given a complete binary tree with up to $2^k - 1$ nodes, where every internal node has exactly two children and the structure is fixed. Each node must be assigned one of six Rubik’s cube face colors.

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

CF 1594E1 - Rubik's Cube Coloring (easy version)

We are given a complete binary tree with $k$ levels, so the number of vertices is $2^k - 1$. Each internal node has exactly two children, and leaves sit at the bottom level. Every node must be assigned one of six colors corresponding to faces of a Rubik’s cube.

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

CF 1594D - The Number of Imposters

We are given a network of players who make statements about each other. Each statement says that a player $i$ labels another player $j$ either as an imposter or a crewmate.

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

CF 1594A - Consecutive Sum Riddle

We are asked to represent a given positive integer $n$ as the sum of consecutive integers over some interval $[l, r]$, where both endpoints are integers and $l < r$. The interval is allowed to extend into negative numbers, so we are not restricted to positive sequences.

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

CF 1594B - Special Numbers

We are asked to enumerate a very specific set of numbers defined by a base expansion rule. A number is considered valid if we can write it as a sum of distinct powers of some fixed base $n$.