Codeforces Round 880 (Div. 2)

Solutions for Codeforces Round 880 (Div. 2) (contest 1836). 2/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 880 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2900 | Time: 10m 11s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Destroyer	800	implementation, sortings	1m 8s	✓
B	Astrophysicists	1100	greedy, math	2m 44s	✗
C	k-th equality	1700	brute-force, greedy, implementation	1m 23s	✓
D	Lottery	2500	binary-search, implementation, two-pointers	1m 30s	✗
E	Twin Clusters	2600	constructive-algorithms, meet-in-the-middle, probabilities	1m 32s	✗
F	Doctor's Brown Hypothesis	2900	dfs-and-similar, graphs, math	1m 54s	✗

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

CF 1836F - Doctor's Brown Hypothesis

We are working with a directed graph where nodes represent planets and edges represent wormholes between them. Each edge takes exactly one hour to traverse.

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

CF 1836E - Twin Clusters

We are given a sequence of integers for each test case, and we are allowed to look at any contiguous segment of this sequence. For any segment, we define its value as the bitwise XOR of all elements inside it.

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

CF 1836B - Astrophysicists

Input: This means: - t = 3 - Each test case consists of a single line containing two integers - So the test cases are: - (10, 2) - (10, 3) - (3, 4) The expected output: This indicates each test case produces two outputs per line or multiple values per case, not a single integer.

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

CF 1836D - Lottery

There are already n participants, each holding a number in the range [0, m]. Then a new participant, Bytek, joins last and chooses his own number. A random target integer t is drawn uniformly from [0, m]. After that, winners are chosen by distance to t: the k closest tickets win.

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

CF 1836C - k-th equality

We are asked to enumerate all valid equations of the form a + b = c, but with strict digit-length constraints: a must have exactly A digits, b exactly B digits, and c exactly C digits. None of the numbers may start with zero, and all three values must be positive integers.

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

CF 1836A - Destroyer

Each robot reports a single integer that describes how many robots stand in front of it in its own line. The twist is that we are not told how many lines exist or which robot belongs to which line.