Codeforces Round 804 (Div. 2)

Solutions for Codeforces Round 804 (Div. 2) (contest 1699). 0/5 problems verified against sample I/O. Difficulty range: 800-2600.

5 items

Codeforces Round 804 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 0/5 | Rating range: 800-2600 | Time: 18m 44s

Problem	Name	Rating	Tags	Solve Time	Verified
A	The Third Three Number Problem	800	constructive-algorithms, math	2m 3s	✗
B	Almost Ternary Matrix	900	bitmasks, constructive-algorithms, matrices	8m 9s	✗
C	The Third Problem	1700	combinatorics, constructive-algorithms, math	3m 2s	✗
D	Almost Triple Deletions	2300	data-structures, dp, greedy	2m 58s	✗
E	Three Days Grace	2600	data-structures, dp, greedy	2m 32s	✗

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

CF 1699B - Almost Ternary Matrix

We are asked to construct a binary matrix of size $n times m$ where $n$ and $m$ are guaranteed to be even. The constraint is that each cell must have exactly two neighbors with a value different from its own. Neighbors are defined as the four cells directly adjacent by side.

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

CF 1699E - Three Days Grace

The problem gives us a multiset of integers, all bounded by a maximum value m, and allows us to repeatedly replace any number x 3 with two integers p and q such that pq = x and both p and q are greater than 1. After each operation, the multiset grows by one element.

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

CF 1699D - Almost Triple Deletions

We are given an array of integers, and we can repeatedly remove adjacent pairs that are different. After each removal, the array shrinks and its remaining elements shift left.

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

CF 1699C - The Third Problem

We are given a permutation of integers from 0 to $n-1$, which is simply a rearrangement of these numbers with no repeats. The task is to count how many other permutations are "similar" to the given one, where similarity is defined through the MEX function.

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

CF 1699A - The Third Three Number Problem

We are asked to construct three integers $a$, $b$, and $c$, each lying in a large range up to $10^9$, such that a specific expression involving pairwise XOR values matches a given target number $n$.