Selection of tasks from Internet olympiads season 2019-20

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

13 items

Selection of tasks from Internet olympiads season 2019-20

Special | 13 problems | 5/13 verified | Difficulty - | 23m 16s

#	Problem	Time	✓
A	Wooden Castle	1m 15s	✓
B	Crazy dance	1m 14s	✓
C	Spell	1m 16s
D	Good Subset	1m 9s	✓
E	Crazy domino	56s
F	Arithmetic and blocks	1m 36s	✓
G	Crazy Arrangements	1m 58s
H	Road building	4m 22s
I	Tennis score	2m 9s
J	Wedding	3m 7s
K	Escape from the Abundoned House	1m 22s	✓
L	Transformations	1m 27s
M	Magical XML	1m 25s

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

CF 102672I - Tennis score

I can write this editorial, but the requested format is much longer than a single response can fit while still including the full proof, implementation, walkthroughs, test harness, and all edge-case sections.

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

CF 102672L - Transformations

I can draft the editorial once I have the full problem text, since the statement section in the prompt is empty and the exact operation details are needed for the explanation and proof. Waiting for your answer

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

CF 102672M - Magical XML

I can write the full editorial, but the problem details are missing. The prompt only includes the title “Codeforces 102672M - Magical XML” and empty sections for the statement, input, and output, so I do not have enough information to derive the algorithm, edge cases…

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

CF 102672J - Wedding

I can write the full editorial, but I’m missing the actual problem details for Codeforces 102672J - Wedding. The statement section in your prompt is empty, and I could not reliably identify the problem from the problem ID alone.

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 task from the problem ID alone.

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

CF 102672H - Road building

Searching 4 websitesSearching 4 websitesSearching 4 websitesYou’re using our basic model. Log in or sign up for more intelligence.Log inSign up for free

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

CF 102672G - Crazy Arrangements

I need the missing problem details to write a correct editorial for this problem. Please provide the full statement or the problem link. Waiting for your answer

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

CF 102672B - Crazy dance

We have n dancers placed on integer coordinates. Several dancers may share the same coordinate. During the dance, every dancer independently moves one unit either left or right with equal probability.

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

CF 102672C - Spell

I can write the editorial, but the problem statement section is empty and I cannot reliably reconstruct the full requirements for Codeforces 102672C - Spell from the title alone.

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

CF 102672K - Escape from the Abundoned House

The house is a rectangular grid. Some cells are blocked by walls, while the remaining cells can be walked through. The friends start in the cell marked s and want to reach the cell marked f.

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 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.