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

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

6 items

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

Special | 6 problems | 6/6 verified | Difficulty - | 6m 12s

#	Problem	Time	✓
A	\u0421\u043a\u043e\u0440\u043e \u043d\u043e\u0432\u044b\u0439 \u0433\u043e\u0434	50s	✓
B	\u041f\u0440\u043e\u0442\u0438\u0432\u043e\u043f\u043e\u043b\u043e\u0436\u043d\u043e\u0441\u0442\u044c	55s	✓
C	\u0420\u043e\u0441\u0441\u044b\u043f\u044c \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u0435\u0439	58s	✓
D	Musculus latissimus dorsi	58s	✓
E	\u0412\u044b \u0432\u0441\u0435 \u0443\u0436\u0435 \u043f\u0440\u0438\u0437\u0451\u0440\u044b	1m 24s	✓
F	\u041f\u043e\u0434\u0430\u0440\u043a\u0438	1m 7s	✓

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

CF 105684E - Вы все уже призёры

We are given a sequence of diploma levels and a sequence of prize types, and we must count how many consistent ways exist to assign prizes to participants grouped by diploma level. There are $m$ diploma categories.

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

CF 105684F - Подарки

We are simulating a sequential distribution process over a fixed number of people. There are $m+1$ participants in total: one special participant, the intern, and $m$ identical regular employees. A list of $n$ gifts arrives in order, each gift carrying a positive value.

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

CF 105684D - Musculus latissimus dorsi

We are given a multiset of stick lengths. Each stick can be used exactly as a full side of a quadrilateral. From these sticks we want to count how many distinct isosceles trapezoids can be formed. A valid trapezoid uses exactly four chosen sticks.

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

CF 105684C - Россыпь делителей

We are given a multiset of integers that are claimed to be divisors of several hidden numbers. Each hidden number belongs to a different employee.

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

CF 105684B - Противоположность

We are given a single integer $n$. The task is to split $n$ into a sum of positive integers, where every summand must avoid a specific forbidden set: powers of two.

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

CF 105684A - Скоро новый год

We are given a fixed number of candies and a fixed number of employees. Each employee must receive either exactly 2 candies or exactly 3 candies. If an employee receives 3 candies, they are considered happy; otherwise, they receive 2 candies and are not happy.