Codeforces Round 800 (Div. 2)

Solutions for Codeforces Round 800 (Div. 2) (contest 1694). 0/2 problems verified against sample I/O. Difficulty range: 800-1200.

2 items

Codeforces Round 800 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-1200 | Time: 4m 51s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Creep	800	greedy, implementation	2m 28s	✗
B	Paranoid String	1200	constructive-algorithms, greedy	2m 23s	✗

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

CF 1694A - Creep

The proposed solution answers the exercise that was actually asked. Exercise 3.4.2.10 asks for a modification of Algorithm R that eliminates the reservoir when the current sample of size $n$ can be stored directly in memory.

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

CF 1694B - Paranoid String

We are asked to count substrings of a binary string that are "paranoid." A paranoid string is one that can be reduced to a single character by repeatedly applying two operations: replacing 01 with 1 or 10 with 0.