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

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

15 items

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

Special | 15 problems | 11/15 verified | Difficulty - | 17m 35s

#	Problem	Time	✓
A	\u0423\u0441\u043f\u0435\u0442\u044c \u043d\u0430 \u0441\u0430\u043c\u043e\u043b\u0451\u0442	41s	✓
B	\u041a\u0432\u0430\u0434\u0440\u0430\u0442\u044b \u0438 \u043f\u0440\u044f\u043c\u044b\u0435	2m 28s
C	Cut into Squares	50s	✓
D	\u0423\u043c\u043d\u043e\u0436\u0435\u043d\u0438\u0435 \u043d\u0430 \u0442\u0440\u0438	44s	✓
E	Division Game	48s	✓
F	\u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u0435\u0439	53s	✓
G	\u041f\u043b\u0430\u043d\u044b \u043d\u0430 \u0432\u0435\u0447\u0435\u0440	2m 29s
H	\u041d\u043e\u0436\u043d\u0438\u0446\u044b	48s	✓
I	\u0420\u0430\u0444\u0442\u0438\u043d\u0433	58s	✓
J	\u0418\u0432\u0430\u043d \u0438 \u0434\u043e\u0440\u043e\u0433\u0438	53s
K	\u0420\u0435\u0447\u043d\u043e\u0439 \u0431\u043e\u0439	49s	✓
L	Outro	1m 4s	✓
M	\u041f\u043e\u043a\u0443\u043f\u043a\u0430 \u0434\u0438\u0432\u0430\u043d\u0430	2m 34s
N	\u041f\u043e\u0434\u0433\u043e\u0442\u043e\u0432\u043a\u0430 \u043a \u041d\u043e\u0432\u043e\u043c\u0443 \u0433\u043e\u0434\u0443	53s	✓
O	\u041a\u0440\u0435\u0441\u0442\u0438\u043a\u0438	43s	✓

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

CF 103361M - Покупка дивана

Let $n = s + t$ as in (1), and consider a $t$-combination $ct cdots c1$ with $n ct cdots c1 ge 0$ together with the additional adjacency restriction $c{j+1} cj + 1 qquad (t j ge 1).$ Define new integers $c'j = cj - (j-1), qquad 1 le j le t.

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

CF 103361O - Крестики

We are given a binary string representing a strip of cells. Some cells already contain a cross, marked as X, and the rest are empty, marked as .. The key constraint is that no two crosses are allowed to be adjacent, meaning we can never have XX in neighboring positions.

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

CF 103361N - Подготовка к Новому году

We are given a small collection of Christmas trees, each with a positive integer height. The task is to pick three different trees such that all three have exactly the same height. The output is the indices of those three trees.

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

CF 103361L - Outro

We are given two collections of strings, one called array a and the other called array b. The task is to pick a single non-empty string s that satisfies two conditions at the same time. First, s must appear as a substring in every string of a.

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

CF 103361K - Речной бой

The game is played on a fixed line of 20 cells. Each player secretly places four contiguous ships of lengths 1, 2, 3, and 4.

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

CF 103361J - Иван и дороги

Codeforces 103361J: Иван и дороги

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

CF 103361A - Успеть на самолёт

We are given a single day schedule involving two time moments and two durations. First, we know when a traveler leaves home, expressed as hours and minutes. From that moment, a navigation system says the travel time to the airport is a fixed number of minutes.

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

CF 103361I - Рафтинг

We are given a directed graph whose vertices are lakes and whose edges are rivers flowing from one lake to another.

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

CF 103361G - Планы на вечер

An (s, t)-combination $c4 c3 c2 c1$ with $t=4$ is a strictly decreasing 4-tuple $$n c4 c3 c2 c1 ge 0,$$ and the condition $c4 - c1 < m$ is equivalent to requiring that all selected elements lie in an interval of length $m-1$.

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

CF 103361H - Ножницы

We are given a rectangle of size $m times n$, and we want to completely tile it using smaller rectangles of fixed size $1 times k$.

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

CF 103361F - Количество делителей

We are maintaining an array of integers that changes over time. Alongside updates, we are repeatedly asked a very specific query: given a segment of the array and a number x, we must count how many elements inside that segment divide x exactly.

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

CF 103361B - Квадраты и прямые

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

CF 103361E - Division Game

The problem describes a two-player game built around repeated division of numbers. We start with a multiset of integers, and players take turns selecting a number and replacing it by one of its proper divisors according to fixed rules of the game.

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

CF 103361D - Умножение на три

We start with a single digit x. From this digit we repeatedly generate new digits by multiplying the current digit by 3 and taking the last decimal digit of the result, then appending it to the right side of the number written on the board.

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

CF 103361C - Cut into Squares

We are given a rectangular board with integer side lengths. The task is to partition this rectangle into smaller squares by cutting along grid lines.