Codeforces Round 796 (Div. 2)

Solutions for Codeforces Round 796 (Div. 2) (contest 1688). 3/3 problems verified against sample I/O. Difficulty range: 800-1700.

3 items

Codeforces Round 796 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 800-1700 | Time: 12m 56s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cirno's Perfect Bitmasks Classroom	800	bitmasks, brute-force	2m	✓
B	Patchouli's Magical Talisman	800	bitmasks, constructive-algorithms, greedy	1m 54s	✓
C	Manipulating History	1700	constructive-algorithms, greedy, strings	9m 2s	✓

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

CF 1688C - Manipulating History

We are asked to reconstruct the initial string of length 1 from which a sequence of operations produced a given final string. Each operation consists of selecting a substring of the current string and replacing it with another string, possibly of different length.

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

CF 1688A - Cirno's Perfect Bitmasks Classroom

We are given a positive integer $x$, and the task is to find the smallest positive integer $y$ such that two bitwise conditions hold simultaneously: the bitwise AND of $x$ and $y$ is greater than zero, and the bitwise XOR of $x$ and $y$ is also greater than zero.

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

CF 1688B - Patchouli's Magical Talisman

We are asked to transform a collection of magical tokens so that every token has an odd magical power. Each token starts with some positive integer power.