2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest

9 problems from 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest (contest 104761), difficulty -. 1/9 solutions verified against sample I/O.

9 items

2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest

ICPC/IOI | 9 problems | 1/9 verified | Difficulty - | 13m 37s

#	Problem	Time	✓
A	\u0418\u0440\u0440\u0430\u0446\u0438\u043e\u043d\u0430\u043b\u044c\u043d\u043e\u0441\u0442\u044c	1m 23s	✓
B	\u0417\u0430\u043d\u0430\u0432\u0435\u0441\u043a\u0430	1m 30s
C	\u0414\u0435\u043b\u0438\u043c\u043e\u0441\u0442\u044c \u043d\u0430 2023	1m 6s
D	\u0418\u0433\u0440\u0430 \u0441 \u0431\u0443\u043c\u0430\u0433\u043e\u0439	1m 29s
E	\u0426\u0438\u0444\u0440\u043e\u0432\u0438\u0437\u0430\u0446\u0438\u044f	1m 20s
F	\u0421\u043f\u0440\u0430\u0432\u0435\u0434\u043b\u0438\u0432\u044b\u0439 \u0440\u0430\u0437\u0440\u0435\u0437	2m 2s
G	\u041d\u0430\u0439\u0442\u0438 \u0441\u043b\u043e\u043d\u0430	1m 40s
H	\u0420\u0430\u0432\u043d\u043e\u043c\u0435\u0440\u043d\u043e\u0435 \u043a\u043e\u0434\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435	1m 19s
I	\u0418\u0433\u0440\u0430 \u043d\u0430 \u0434\u0435\u0440\u0435\u0432\u0435	1m 48s

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761I - Игра на дереве

We are given a tree with $n$ vertices. One player first selects a vertex $u$, then an adversary selects a different vertex $v$. After that, a vertex $w$ is chosen uniformly at random from all $n$ vertices.

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761H - Равномерное кодирование

We are asked to design a binary codebook for a given number of commands $K$. Each command is a binary string of some even length $Len$, and we must assign $K$ distinct strings. These strings are not arbitrary. They must satisfy two structural constraints.

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761F - Справедливый разрез

We are given a fixed triangle placed in a coordinate system. One vertex is at the origin, a second vertex is at $(a,b)$, and the third is on the x-axis at $(c,0)$. Inside this triangle, a point $P$ is already fixed and guaranteed to lie on one of its sides.

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761G - Найти слона

We are interacting with a hidden chess problem on an 8 by 8 board where a bishop is placed on an unknown square. We do not know its position, but we can query any square and receive feedback about the minimum number of bishop moves required to reach that square from the hidden…

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761E - Цифровизация

Each dataset describes a single livestock breed. Inside a breed we are given many records, and each record corresponds to one animal passport. A passport contains three identifiers: the calf itself, its father, and its mother.

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761B - Занавеска

We are simulating a deterministic process that gradually “fills” positions from a line segment of length $N$. The positions are numbered from $1$ to $N$. The process starts by immediately selecting the two endpoints, so positions $1$ and $N$ are used at step 1.

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761D - Игра с бумагой

We start with a rectangular grid of size $W times H$. Each move allows us to cut the rectangle along a grid line, splitting it into two smaller rectangles either horizontally or vertically.

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761C - Делимость на 2023

We are given two distinct digits, call them $A$ and $B$, each between 0 and 9. From only these two digits, we are allowed to construct any positive integer by concatenating them in any order and any length, as long as we do not use any other digit.

Practice › Codeforces Solutions › 2023-2024 ICPC NERC (NEERC), Kyrgyzstan Regional Contest ›

CF 104761A - Иррациональность

We are asked to find all lattice points in the first quadrant whose distance to the origin is exactly $Dsqrt{2}$. Squaring the distance removes the square root, so we are really searching for all non-negative integer pairs $(x, y)$ such that $$x^2 + y^2 = 2D^2.