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

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

9 items

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

ICPC/IOI | 9 problems | 7/9 verified | Difficulty - | 10m 14s

#	Problem	Time	✓
A	\u041c\u043d\u043e\u0433\u043e \u0440\u0430\u043a\u0443\u0448\u0435\u043a	1m 8s	✓
B	\u0412\u044b\u0438\u0433\u0440\u044b\u0448	1m	✓
C	\u0414\u043e\u0440\u043e\u0433\u0430	58s	✓
D	\u0412\u0435\u0441\u0435\u043b\u044b\u0435 \u0444\u043e\u043d\u0430\u0440\u0438	1m 9s
E	Old Cipher	1m 29s
F	\u0427\u0435\u0433\u043e-\u0442\u043e \u043d\u0435 \u0445\u0432\u0430\u0442\u0430\u0435\u0442...	55s	✓
G	\u0415\u0441\u0442\u044c \u043b\u0438 \u0441\u0434\u0430\u0447\u0430?	1m 13s	✓
H	\u0412\u043c\u0435\u0441\u0442\u0435 \u043d\u0430\u0432\u0441\u0435\u0433\u0434\u0430	1m 21s	✓
I	\u041d\u0430\u043b\u043e\u0433\u043e\u0432\u044b\u0439 \u0432\u043e\u043f\u0440\u043e\u0441	1m 1s	✓

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

CF 104760I - Налоговый вопрос

We are given a graph of planets where each planet is connected to some others by two-way direct routes. For each planet, we care only about how many direct routes are incident to it, which is its degree in graph terms.

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

CF 104760E - Old Cipher

We are given a sequence of natural numbers that represent encrypted keys. The task is to reorder these numbers according to a custom sorting rule that is not based on their usual numeric value, but on a transformation of each number.

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

CF 104760D - Веселые фонари

The city can be modeled as an undirected graph where each lamp post is a vertex and each street is an edge between two vertices. The task is to decide whether we can assign one of two colors to each vertex so that every street connects vertices of different colors.

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

CF 104760A - Много ракушек

We are given a linear sequence of shells, each with a positive weight. The shells are arranged in order along a beach, and we are only allowed to take a consecutive block of them.

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

CF 104760F - Чего-то не хватает...

We are given a multiset of integer “types” representing items in a warehouse. Most types are perfectly balanced: every such type appears the same number of times, say $S$. Exactly one exceptional type breaks this pattern and appears fewer times, say $P$, where $P < S$.

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

CF 104760H - Вместе навсегда

We are given two groups of travelers initially split across two different universes, with A people on one side and B people on the other. Between the two universes there are N portals, and each portal can be used a limited number of times.

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

CF 104760G - Есть ли сдача?

We are given a system with two coin denominations, A and B. Using these coins, one person must pay an exact amount N, but the interaction is slightly more flexible than a standard coin change problem because overpayment is allowed and the difference is returned as change using…

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

CF 104760B - Выигрыш

We are given a small undirected flight network where airports are nodes and flights are edges. A traveler starts at airport 1 and is allowed to take exactly K flights. Each flight moves along an undirected edge to a neighboring airport.

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

CF 104760C - Дорога

We are given a collection of intervals placed along a number line. Each interval represents a lamp that illuminates a segment of a road, from its starting coordinate to its ending coordinate.