Турнир Архимеда 2016

10 problems from Турнир Архимеда 2016 (contest 103666), difficulty -. 9/10 solutions verified against sample I/O.

10 items

Турнир Архимеда 2016

Special | 10 problems | 9/10 verified | Difficulty - | 9m 38s

#	Problem	Time	✓
A	\u0410\u043b\u0451\u043d\u0430, \u043f\u043e\u043c\u043d\u0438 \u0432\u043e\u0437\u0440\u0430\u0441\u0442 \u0412\u0438\u0442\u0438!	50s	✓
B	\u0422\u0440\u043e\u0439\u043d\u043e\u0439 \u0424\u0438\u0431\u043e\u043d\u0430\u0447\u0447\u0438	51s	✓
C	\u041c\u0430\u0440\u0441\u0438\u0430\u043d\u0441\u043a\u0438\u0435 \u043d\u043e\u043b\u0438\u043a\u0438	49s	✓
D	\u0421\u043f\u043e\u0440\u0442 \u0438\u043b\u0438 \u0435\u0434\u0430	45s	✓
E	\u0421\u0431\u043e\u0440\u043d\u0430\u044f \u042e\u043f\u0438\u0442\u0435\u0440\u0430	59s	✓
F	\u041c\u0430\u0448\u0430 \u0438 \u043c\u0430\u0442\u0440\u0451\u0448\u043a\u0438	41s	✓
G	ASCII-\u0433\u0440\u0430\u0444\u0438\u043a\u0430	53s	✓
H	\u0420\u043e\u0431\u043e\u0442	2m 18s
I	\u041d\u0443\u0436\u043d\u043e \u0431\u043e\u043b\u044c\u0448\u0435 \u0437\u043e\u043b\u043e\u0442\u0430	47s	✓
J	\u0411\u0430\u0448\u043d\u0438	45s	✓

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666F - Маша и матрёшки

We are given a collection of matryoshka dolls, each with a numeric size. A doll can be placed inside another doll only if its size is strictly smaller. Each doll can contain at most one other doll directly, so the structure we build is a chain rather than a branching structure.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666H - Робот

Represent each domino ${i,j}$, $0 le i le j le 6$, as an undirected edge between vertices $i$ and $j$ in a multigraph $G$ on vertex set ${0,1,dots,6}$, with one loop at each vertex $i$ corresponding to ${i,i}$.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666A - Алёна, помни возраст Вити!

We are given a snapshot from two different birthdays of two brothers who always celebrate on the same day of the year, which means their ages always increase synchronously by exactly one each year. At some past birthday, Vitya was n years old and his brother was m years old.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666J - Башни

We are given a sequence of tower heights placed along a line, where each position has a unique height value. The task is to count how many triples of indices $i < j < k$ form a strictly increasing sequence in both position and height, meaning $hi < hj < hk$.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666I - Нужно больше золота

We are given a collection of magical artifacts, each with a positive value $wi$. The hero starts with zero magical power. Each artifact must be used exactly once, and each one can be activated in one of two ways.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666G - ASCII-графика

We are given a small grid, where each cell is a character representing a tiny square tile of a drawing. Each tile is either empty or contains a diagonal segment.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666E - Сборная Юпитера

We are given a small grid, at most 20 by 20, where each cell contains a direction character among N, S, E, and W.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666C - Марсианские нолики

We are working in a positional numeral system with base $k$, where numbers are written using digits from $0$ to $k-1$. A number is called “sufficiently round” if, when written in base $k$, its representation ends with at least $n$ zero digits.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666D - Спорт или еда

We are given a binary schedule of length $n$, where each position represents what Arseniy plans to do in a specific hour: either training or eating. The schedule is fixed as a string over two characters, where one letter stands for training and the other for eating.

Practice › Codeforces Solutions › Турнир Архимеда 2016 ›

CF 103666B - Тройной Фибоначчи

We are given a Fibonacci-like sequence where the first two terms are fixed as $F1 = 1$ and $F2 = 2$, and every later term is the sum of the previous two. This produces a deterministic infinite sequence of integers.