Selection of tasks from Internet olympiads season 2019-20

5 problems from Selection of tasks from Internet olympiads season 2019-20 (contest 102672), difficulty -. 3/5 solutions verified against sample I/O.

5 items

Selection of tasks from Internet olympiads season 2019-20

Special | 5 problems | 3/5 verified | Difficulty - | 5m 59s

#	Problem	Time	✓
A	Wooden Castle	1m 15s	✓
D	Good Subset	1m 9s	✓
E	Crazy domino	47s
F	Arithmetic and blocks	1m 36s	✓
G	Crazy Arrangements	1m 12s

Practice › Codeforces Solutions › Selection of tasks from Internet olympiads season 2019-20 ›

CF 102672G - Crazy Arrangements

I need the actual problem details to write a correct editorial. The statement section appears to be empty, and I cannot reliably infer the algorithm from the title alone. Please provide the full statement or a link. Waiting for your answer

Practice › Codeforces Solutions › Selection of tasks from Internet olympiads season 2019-20 ›

CF 102672F - Arithmetic and blocks

We have an original array of non-negative integers. Instead of seeing that array directly, we are given every consecutive sum of length K.

Practice › Codeforces Solutions › Selection of tasks from Internet olympiads season 2019-20 ›

CF 102672E - Crazy domino

I can write the full editorial, but the problem statement for Codeforces 102672E - Crazy domino is missing from the prompt, and I could not reliably identify the exact problem from the available information.

Practice › Codeforces Solutions › Selection of tasks from Internet olympiads season 2019-20 ›

CF 102672D - Good Subset

The problem gives a collection of positive integers written on a lock. We need to choose as many of those integers as possible so that every chosen number has a common divisor greater than one.

Practice › Codeforces Solutions › Selection of tasks from Internet olympiads season 2019-20 ›

CF 102672A - Wooden Castle

The lock is a tree whose vertices are painted in two colors. A move can either repaint one vertex or remove an entire connected region whose vertices all currently have the same color. The task is to find the minimum number of moves needed until no vertices remain.