Contest for Yandex interns 2019

6 problems from Contest for Yandex interns 2019 (contest 102558), difficulty -. 3/6 solutions verified against sample I/O.

6 items

Contest for Yandex interns 2019

Special | 6 problems | 3/6 verified | Difficulty - | 25m 27s

#	Problem	Time	✓
A	\u0414\u0435\u043d\u044c \u0440\u043e\u0436\u0434\u0435\u043d\u0438\u044f \u0412\u0430\u0441\u0438	3m 46s
B	\u0417\u0430\u043a\u0440\u044b\u0442\u044b\u0439 \u043a\u043b\u044e\u0447	1m 33s	✓
C	\u041f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u0438\u0441\u0442 \u043d\u0430 \u043f\u043b\u044f\u0436\u0435	6m 26s
D	\u041f\u0435\u0440\u0435\u043c\u0435\u0449\u0435\u043d\u0438\u0435 \u0447\u0430\u043d\u043a\u043e\u0432	10m 55s	✓
E	\u0420\u0430\u0437\u0434\u0435\u043b\u0435\u043d\u0438\u0435 \u0433\u0440\u0430\u0444\u0430	1m 36s	✓
F	\u041f\u043e\u0438\u0441\u043a	1m 11s

Practice › Codeforces Solutions › Contest for Yandex interns 2019 ›

CF 102558A - День рождения Васи

Vasya has a collection of dishes. Each dish is a list of ingredients with a required amount for one serving, and each dish is prepared for a known number of guests.

Practice › Codeforces Solutions › Contest for Yandex interns 2019 ›

CF 102558F - Поиск

The requested editorial is too large to fit reliably in a single response while preserving all required sections, the full proof explanation, the complete Python solution, worked traces, and test suite. I can provide it as a multi-part editorial.

Practice › Codeforces Solutions › Contest for Yandex interns 2019 ›

CF 102558E - Разделение графа

The graph contains vertices connected by weighted undirected edges. We have to color the vertices with two colors, with both colors used, and look at the edges whose endpoints received the same color. Among those edges, we care about the smallest weight.

Practice › Codeforces Solutions › Contest for Yandex interns 2019 ›

CF 102558B - Закрытый ключ

The public key is created from a private pair of positive integers (p, q). The first public value is the greatest common divisor of the pair, and the second is the least common multiple.

Practice › Codeforces Solutions › Contest for Yandex interns 2019 ›

CF 102558D - Перемещение чанков

We have an array of n chunks. The value at position i tells which server currently stores chunk i. A query asks to move every chunk in an interval [l, r] from server a to server b. The move is allowed only if every value in that interval is exactly a before the operation.

Practice › Codeforces Solutions › Contest for Yandex interns 2019 ›

CF 102558C - Программист на пляже

We have a collection of beach chairs, and each chair has a number describing its external features. The task is to choose two different chairs whose numbers have the smallest possible XOR value.