2025-2026 ICPC NERC, Kyrgyzstan Regional Contest

10 problems from 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest (contest 106169), difficulty -. 6/10 solutions verified against sample I/O.

10 items

2025-2026 ICPC NERC, Kyrgyzstan Regional Contest

ICPC/IOI | 10 problems | 6/10 verified | Difficulty - | 7m 17s

#	Problem	Time	✓
A	Borg Cube	40s	✓
B	Nostalgia	37s	✓
C	You can't just take and divide	48s	✓
D	Treasure	37s	✓
E	Visualize This	26s
F	Sign Entanglement	38s	✓
G	Secret Words	45s	✓
H	Nested Loops	23s
I	Cutting Trees	1m 59s
J	Laser Balancing	24s

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169I - Cutting Trees

Sure. Please provide the Codeforces problem statement (or a link/name), and I’ll write a detailed competitive programming editorial covering: - Problem restatement / intuition - Key observations - Derivation of the algorithm - Proof of correctness - Complexity analysis -…

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169J - Laser Balancing

I can write the editorial in that format, but I need the actual problem statement for Codeforces 106169J - Laser Balancing first.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169G - Secret Words

We are given a dictionary of secret words and a text string. The text contains lowercase letters and the special character ?. A ? can stand for any single lowercase letter. The task is to count how many different ways the entire text can be split into dictionary words.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169H - Nested Loops

I can write the full editorial in that format, but the actual problem statement for Codeforces 106169H - Nested Loops is missing from the prompt.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169F - Sign Entanglement

The problem asks us to count pairs of events where the two events happened close enough in time and have opposite signs. Each record gives a timestamp and a sign, where + and - represent the two different sides.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169D - Treasure

The map is a rectangular island grid. A cell can either be water, which blocks movement, an empty land cell, or a cell containing a unique landmark represented by an uppercase letter.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169E - Visualize This

I can't write a correct editorial for Codeforces 106169E - Visualize This because the actual problem statement is missing from your prompt. The template shows: but the contents are empty. Without the statement, I do not know: - What the input represents.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169C - You can't just take and divide

We need count integers in the interval from 1 to n that satisfy two conditions. The number itself must be odd, and the amount of positive divisors it has must be an odd prime number.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169A - Borg Cube

A cube has six face values: top, bottom, left, right, front, back. Every corner of the cube touches exactly three faces. The value hidden at a corner is defined as the product of the three face values meeting at that corner. There are eight corners in total.

Practice › Codeforces Solutions › 2025-2026 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 106169B - Nostalgia

The program being analyzed is written in Scratch and consists of simple commands that read values, store them in variables, calculate new values, and print results. During their early testing, the programmers used an extra debugging output before every input operation.