2024-2025 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
13 problems from 2024-2025 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals) (contest 105537), difficulty -. 3/13 solutions verified against sample I/O.
2024-2025 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
ICPC/IOI | 13 problems | 3/13 verified | Difficulty - | 7m 2s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Another Brick in the Wall | 52s | ✓ | |||
| B | Brick in the Wall, Part 2 | 32s | ||||
| C | Capybara Cozy Carnival | 28s | ||||
| D | Defective Script | 25s | ||||
| E | Eight-Shaped Figures | 30s | ||||
| F | False Alarm | 29s | ||||
| G | Game of Annihilation | 26s | ||||
| H | Hanoi Towers Reloaded | 30s | ||||
| I | If I Could Turn Back Time | 21s | ||||
| J | Just Half is Enough | 29s | ||||
| K | Keyboard Chaos | 29s | ||||
| L | Longest Common Substring | 46s | ✓ | |||
| M | Mis\u00e8re | 45s | ✓ |
CF 105537L - Longest Common Substring
We are given two strings, and we want to determine the length of the longest contiguous segment that appears in both strings. A contiguous segment here means a substring, so characters must match in order and without gaps.
CF 105537M - Misère
The problem describes a two-player impartial game played on several piles of objects. Players alternate moves, and on each move a player selects a single pile and removes at least one object from it.
CF 105537K - Keyboard Chaos
I can’t write a correct editorial for this yet because the actual problem statement for 105537K - Keyboard Chaos is missing from your prompt. Right now I don’t know: - what the input represents (strings, arrays, graph, etc.
CF 105537J - Just Half is Enough
The prompt is missing the actual problem statement for Codeforces 105537J - Just Half is Enough, so there isn’t enough information to derive the solution, constraints, or algorithm.
CF 105537I - If I Could Turn Back Time
We are given two sequences of mountain heights of the same length. One represents the current landscape, the other represents an earlier state. The landscape evolves over discrete years.
CF 105537H - Hanoi Towers Reloaded
I can’t produce a correct Codeforces editorial from that reference alone because “105537H - Hanoi Towers Reloaded” doesn’t include the actual problem statement, and there are multiple possible variants of Hanoi-style problems (move counting, forbidden states, k-pegs…
CF 105537F - False Alarm
I can’t reliably write a correct editorial for “Codeforces 105537F - False Alarm” because the actual problem statement is missing from your prompt.
CF 105537G - Game of Annihilation
We are given a very large one dimensional board that extends infinitely to the right. On some of its cells, there are stacks of red and blue chips. Red chips belong to the first player, blue chips belong to the second player.
CF 105537E - Eight-Shaped Figures
The problem statement section is empty, so there isn’t enough information to write a correct editorial. For a Codeforces editorial, I need at least the actual task description (what the input grid/graph represents, what counts as an “eight-shaped figure”, and what we are…
CF 105537D - Defective Script
We are given a circular network of servers, each holding a non-negative load. The system provides an operation that is supposed to reduce load locally, but it is slightly broken: when applied to a server, it reduces that server by two units and also reduces its previous…
CF 105537A - Another Brick in the Wall
We are given a sequence of bricks placed in a line. Each brick has a width of one unit and a certain height. We also have a fixed row width, meaning we can place only a limited number of bricks side by side in a single row.
CF 105537B - Brick in the Wall, Part 2
The problem statement section is empty, so there’s no information about what “Brick in the Wall, Part 2” actually asks.
CF 105537C - Capybara Cozy Carnival
We are given a convex polygon with $n$ vertices arranged in order, forming the boundary of a “cake.” Each vertex must be assigned one of $k$ colors.