Олимпиада НЕЙМАРК 2024-25, Первый отбор

6 problems from Олимпиада НЕЙМАРК 2024-25, Первый отбор (contest 105683), difficulty -. 6/6 solutions verified against sample I/O.

6 items

Олимпиада НЕЙМАРК 2024-25, Первый отбор

Special | 6 problems | 6/6 verified | Difficulty - | 5m 33s

#	Problem	Time	✓
A	\u0411\u0435\u0433 \u0432 \u0434\u0432\u0435 \u0441\u0442\u043e\u0440\u043e\u043d\u044b	53s	✓
B	\u0411\u0435\u0433 \u0432 \u043e\u0434\u043d\u0443 \u0441\u0442\u043e\u0440\u043e\u043d\u0443	48s	✓
C	\u041f\u043b\u0430\u043a\u0430\u0442	50s	✓
D	\u041b\u0438\u043d\u0438\u044f \u043c\u0435\u0442\u0440\u043e	1m 6s	✓
E	\u0412\u0437\u0430\u0438\u043c\u043d\u043e-\u0443\u043f\u0440\u043e\u0449\u0435\u043d\u043d\u044b\u0435	49s	✓
F	\u0417\u043c\u0435\u0439\u043a\u0430	1m 7s	✓

Practice › Codeforces Solutions › Олимпиада НЕЙМАРК 2024-25, Первый отбор ›

CF 105683F - Змейка

We are given a very large rectangular grid of size $w times h$. A snake of fixed length $k$ must be placed in a “straightened” form, meaning it occupies exactly $k$ consecutive cells either horizontally in one row or vertically in one column.

Practice › Codeforces Solutions › Олимпиада НЕЙМАРК 2024-25, Первый отбор ›

CF 105683D - Линия метро

We are given a tree that is built incrementally. The first district is the center of the city, and every next district is attached to one previously built district, so the structure is always a rooted tree with node 1 as the root. Each district has a population value.

Practice › Codeforces Solutions › Олимпиада НЕЙМАРК 2024-25, Первый отбор ›

CF 105683E - Взаимно-упрощенные

We are asked to count pairs of distinct integers $a$ and $b$ with $1 le a < b le n$, such that the pair has exactly two common divisors. The only numbers that are guaranteed to divide both $a$ and $b$ are the divisors of their greatest common divisor.

Practice › Codeforces Solutions › Олимпиада НЕЙМАРК 2024-25, Первый отбор ›

CF 105683A - Бег в две стороны

We are given two ordered collections of target points on a line: one set lies strictly to the right of the origin and the other strictly to the left. A robot starts at position 0 and must visit every point in both sets.

Practice › Codeforces Solutions › Олимпиада НЕЙМАРК 2024-25, Первый отбор ›

CF 105683C - Плакат

We are given a string of length $n$, representing a poster already filled with uppercase Latin letters. The task is to modify this string so that the substring “NEIMARK” appears as many times as possible, while balancing a cost model: changing any character costs 1 unit of…

Practice › Codeforces Solutions › Олимпиада НЕЙМАРК 2024-25, Первый отбор ›

CF 105683B - Бег в одну сторону

Two objects move strictly to the right on a number line. The human starts one meter ahead of the robot and moves with constant speed v1 meters per second, meaning after t seconds the human has advanced exactly t · v1 meters beyond its initial offset.