II Открытая командная олимпиада ЮМШ по программированию

15 problems from II Открытая командная олимпиада ЮМШ по программированию (contest 104313), difficulty -. 14/15 solutions verified against sample I/O.

15 items

II Открытая командная олимпиада ЮМШ по программированию

Special | 15 problems | 14/15 verified | Difficulty - | 13m 18s

#	Problem	Time	✓
A	\u041b\u0438\u0432\u0441\u0438 \u0438 <<\u0428\u0430\u0448\u043c\u0430\u0442\u044b>>	34s
B	\u041a\u0430\u0448\u0442\u0430\u043d\u044b	54s	✓
C	\u042f \u043a\u0430\u043b\u0435\u043d\u0434\u0430\u0440\u044c	45s	✓
D	\u0414\u0435\u043b\u0438\u043c\u044b\u0435 \u0447\u0438\u0441\u043b\u0430	50s	✓
E	\u0423\u0440\u043e\u043a \u0444\u0438\u0437\u043a\u0443\u043b\u044c\u0442\u0443\u0440\u044b	58s	✓
F	\u0427\u0451\u0442\u043d\u043e-\u043d\u0435\u0447\u0451\u0442\u043d\u044b\u0435 \u043f\u0440\u0438\u0431\u0430\u0432\u043b\u0435\u043d\u0438\u044f	54s	✓
G	\u0414\u0432\u0435 \u0446\u0438\u0444\u0440\u044b	46s	✓
H	\u0414\u043e\u0431\u0430\u0432\u043b\u0435\u043d\u0438\u0435 \u0438 GCD	58s	✓
I	\u041c\u0435\u0442\u0440\u043e	56s	✓
J	MEX vs. MID	53s	✓
K	\u041c\u0430\u0441\u0441\u0438\u0432 \u0438 \u0441\u0442\u0435\u043f\u0435\u043d\u0438 \u0434\u0432\u043e\u0439\u043a\u0438	58s	✓
L	\u041f\u043e\u0447\u0435\u043c\u0443 \u043a\u0430\u0440\u0442\u044b \u0432 \u0434\u0440\u0443\u0433\u043e\u043c \u043f\u043e\u0440\u044f\u0434\u043a\u0435?	1m 11s	✓
M	\u0423\u0447\u0430\u0441\u0442\u043e\u043a \u0434\u043e\u0440\u043e\u0433\u0438	43s	✓
N	\u0421\u043e\u043a\u0440\u043e\u0432\u0438\u0449\u0435	51s	✓
O	\u0411\u044e\u0434\u0436\u0435\u0442\u043d\u043e\u0435 \u043f\u0443\u0442\u0435\u0448\u0435\u0441\u0442\u0432\u0438\u0435	1m 7s	✓

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313O - Бюджетное путешествие

We are given an undirected connected graph representing cities and bidirectional roads. Some roads have a special property: if removing such a road would disconnect the graph, then that road is considered expensive.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313N - Сокровище

We are given a hidden position on a one-dimensional strip of cells numbered from 1 to n, where n can be as large as 10^9. Exactly one cell contains a buried treasure. We can interact with the judge by choosing a cell i and effectively placing a detector there.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313L - Почему карты в другом порядке?

We are given a final sequence of cards that appeared on a table during a game. In the game, the players start with a hidden initial deck, and repeatedly remove either the top or the bottom card of the deck.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313M - Участок дороги

We are given a fixed 4×4 grid made of two types of cells: road cells represented by dots and fence cells represented by hashes. The grid encodes a small road junction.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313K - Массив и степени двойки

We are given an array of integers, and we are allowed to modify it using a very specific operation. Each position in the array can be used at most once, and when we use position i, we multiply the value at that position by i.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313J - MEX vs. MID

We are given a permutation of size $n$, meaning it contains every integer from $0$ to $n-1$ exactly once. For every contiguous subarray, we compute two values. The first value is the mex of the subarray, which is the smallest non-negative integer missing from that subarray.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313I - Метро

We are given a collection of straight lines on the plane, each defined by an equation of the form $y = kx + b$. We are not asked to analyze intersections between arbitrary pairs of lines or to find a geometric intersection point.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313H - Добавление и GCD

We are given an array of integers that is modified over time, and we must answer queries about its subarray GCD. Two operations happen online. The first operation adds a fixed value to every element in a prefix or a range.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313G - Две цифры

We imagine a huge infinite tape formed by writing the integers from 1 up to 10¹⁰ in order, without any separators. So the string begins as 1234567891011121314... and continues by appending each next integer in decimal form.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313F - Чётно-нечётные прибавления

We are given several independent test cases. In each test case there is an array of integers, and then a sequence of operations.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313E - Урок физкультуры

We are given a group of $n$ students who must be split into exactly two teams. Both teams must be non-empty. There is also a lower bound $k$, meaning each team must contain at least $k$ students.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313D - Делимые числа

We are given two disjoint integer intervals: one interval for x and one interval for y. Specifically, x must be chosen strictly greater than a and at most c, and y must be strictly greater than b and at most d.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313B - Каштаны

We are given a group of n children who each collected some number of chestnuts and then placed them into a single pile. The first child in order, Sasha, puts his chestnuts into the pile first. Every next child contributes twice as many chestnuts as the previous child.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313C - Я календарь

We are given a single month where the weekday of one specific day is known. That known anchor consists of a day number between 1 and 31 and a weekday name such as Monday or Sunday. Using this anchor, we must determine the weekday of another day in the same month.

Practice › Codeforces Solutions › II Открытая командная олимпиада ЮМШ по программированию ›

CF 104313A - Ливси и <<Шашматы>>

The problem statement is not included in your message, so there isn’t enough information to reconstruct what needs to be solved.