Codeforces Round 571 (Div. 2)

Solutions for Codeforces Round 571 (Div. 2) (contest 1186). 2/5 problems verified against sample I/O. Difficulty range: 800-2500.

5 items

Codeforces Round 571 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 2/5 | Rating range: 800-2500 | Time: 23m 39s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Vus the Cossack and a Contest	800	implementation	3m 8s	✓
C	Vus the Cossack and Strings	1800	implementation, math	3m 23s	✓
D	Vus the Cossack and Numbers	1500	constructive-algorithms, greedy, math	4m 36s	✗
E	Vus the Cossack and a Field	2500	divide-and-conquer, implementation, math	5m 45s	✗
F	Vus the Cossack and a Graph	2400	dfs-and-similar, graphs, greedy	6m 47s	✗

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

CF 1186F - Vus the Cossack and a Graph

We are given an undirected simple graph. Every vertex has some initial degree, and we are allowed to delete edges. After deletions, each vertex must still keep at least half of its original incident edges, rounded up.

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

CF 1186E - Vus the Cossack and a Field

The construction described in this problem defines an infinite binary matrix generated from a small starting grid.

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

CF 1186D - Vus the Cossack and Numbers

We are given an array of real numbers whose total sum is exactly zero. Each number has a fixed decimal precision, so every value can be thought of as a rational number with a known fractional part.

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

CF 1186A - Vus the Cossack and a Contest

We are given a small distribution problem. There are several participants in a contest, and each participant must receive two items: one pen and one notebook.

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

CF 1186C - Vus the Cossack and Strings

We are given a long binary string a and a shorter or equal-length binary string b. We slide b across every possible window of a of the same length, and for each position we compare the two strings character by character.