ICPC Central Russia Regional Qualification Round, 2024

11 problems from ICPC Central Russia Regional Qualification Round, 2024 (contest 106034), difficulty -. 5/11 solutions verified against sample I/O.

11 items

ICPC Central Russia Regional Qualification Round, 2024

ICPC/IOI | 11 problems | 5/11 verified | Difficulty - | 8m 23s

#	Problem	Time	✓
A	\u0422\u0435\u043b\u0435\u0444\u043e\u043d\u043d\u044b\u0435 \u043d\u043e\u043c\u0435\u0440\u0430	45s	✓
B	QR-\u043a\u043e\u0434	33s
C	\u041d\u0435\u0437\u043d\u0430\u0439\u043a\u0430 \u0438 \u0441\u0442\u043e\u043f\u043a\u0430 \u0432\u0438\u0437\u0438\u0442\u043e\u043a	52s	✓
D	\u0417\u0430\u0434\u0430\u0447\u0430 \u043d\u0430 \u0433\u0440\u0430\u0444\u044b	28s
E	\u041f\u0438\u043f\u0435\u0442\u043a\u0430	1m 57s
F	\u041c\u0430\u0433\u0430\u0437\u0438\u043d	51s	✓
G	\u0418\u0433\u0440\u0430 \u0441 \u043a\u0430\u043c\u043d\u044f\u043c\u0438	28s
H	\u0420\u0430\u0437\u043d\u043e\u0446\u0432\u0435\u0442\u043d\u044b\u0435 \u043a\u0443\u0431\u0438\u043a\u0438	28s
I	\u041d\u0435\u0437\u043d\u0430\u0439\u043a\u0430 \u043d\u0430 \u041b\u0443\u043d\u0435	41s	✓
J	Prompts	29s
K	\u041d\u0435\u0437\u043d\u0430\u0439\u043a\u0430 \u0438 \u043f\u043e\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u044c	51s	✓

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034K - Незнайка и последовательность

We are given a sequence defined by a fixed linear recurrence of order three. The first three values are fixed as 1, 1, and 2.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034E - Пипетка

Sure. Please provide the Codeforces problem statement (or link, title, constraints, and examples), and I’ll write a detailed editorial covering: - Problem restatement - Key observations / intuition - Proof of correctness - Algorithm - Complexity analysis - Implementation…

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034J - Prompts

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 106034J - Prompts isn’t included in your message, and I don’t have reliable access to the missing details (input format, required output, constraints, or what “prompts”…

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034I - Незнайка на Луне

We are given a sequence of platforms arranged in a line from position 1 to position n. Each platform has a height. A character starts at platform 1 and wants to reach platform n using a sequence of jumps.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034H - Разноцветные кубики

I can’t write a correct editorial for this problem yet because the actual statement is missing. Right now I only see the title “Codeforces 106034H - Разноцветные кубики”, but there is no description of what the cubes represent, what operations are…

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034F - Магазин

We are given multiple independent test cases. Each test case describes a collection of intervals, one interval per person. Person i is only allowed to be assigned a single integer position, and that position must lie inside their interval $[li, ri]$.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034G - Игра с камнями

The problem statement, input format, and output format are missing from your prompt, so I can’t reliably reconstruct the solution or write a correct editorial for Codeforces 106034G.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034D - Задача на графы

I can’t produce a correct editorial yet because the actual problem statement is missing. Right now I only see the title “106034D - Задача на графы”, but no description of what the graph problem is asking, what the input/output format is, or the constraints.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034C - Незнайка и стопка визиток

The process described in the task is about a pile of business cards that undergoes a sequence of operations. Initially there is some unknown number of cards arranged in a single stack.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034A - Телефонные номера

The problem is about comparing phone numbers written in several possible human-friendly formats. Vasya wants to add one new number to his contacts, but he needs to know whether each of the three existing records refers to the same actual phone number.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualification Round, 2024 ›

CF 106034B - QR-код

I don’t have the actual statement for Codeforces 106034B “QR-код” in your prompt, so I can’t responsibly write a correct editorial yet.