ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier

12 problems from ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier (contest 105437), difficulty -. 1/12 solutions verified against sample I/O.

12 items

ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier

ICPC/IOI | 12 problems | 1/12 verified | Difficulty - | 21m 51s

# Problem Rating Tags Accepted Time ✓
A Cutting into Parts 1m 29s ✓
B Two Screens 1m 32s
C Repainting Balls 1m 51s
D Equal Halves 1m 46s
E Binomial Coefficients, Kind Of 2m 4s
F New Game 1m 30s
G Stores 1m 37s
H Maximum Beauty 2m 1s
I Attribute Checks 1m 31s
J Card Game 3m
K Choose Your Queries 1m 35s
L Variable Damage 1m 55s
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437J - Card Game

We are given a complete grid of cards indexed by suit and rank. For every suit from 1 to n and every rank from 1 to m, exactly one card exists, so the deck forms an n by m matrix. Two players split this entire set into two equal halves.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437L - Variable Damage

We are building a growing army that changes over time, and after every update we want to know how long the battle can last if we assign equipment optimally. At any moment there are heroes, each with a health value, and artifacts, each with a durability value.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437K - Choose Your Queries

We are building an array of size $n$, initially filled with zeros. We process $q$ operations one by one. Each operation gives us two distinct indices $xi$ and $yi$.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437H - Maximum Beauty

We are given a string of lowercase letters. Its “score” is computed by splitting it into maximal contiguous segments of identical characters, then summing the square of each segment’s length. Long runs contribute disproportionately because squaring rewards concentration.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437I - Attribute Checks

We are given a long ordered sequence of events in a game. Each event is either earning a single attribute point or encountering a check that depends on one of two stats, Strength or Intelligence.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437G - Stores

We are given a set of fixed points on a number line, including the endpoints 0 and 10^9, which represent existing store locations in a city.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437E - Binomial Coefficients, Kind Of

We are given many independent queries. Each query specifies a pair of indices $n$ and $k$, and we are asked to compute a value from a triangular table $C$ that is generated in a nonstandard way. The table is built row by row.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437F - New Game

We are given a multiset of cards, each card carrying an integer value. Monocarp builds a sequence by picking cards one by one, removing them from the deck as he takes them.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437D - Equal Halves

We are given an array of even length, split conceptually into two equal parts: the left half and the right half. We are allowed to perform exactly one swap, but the swap is heavily constrained.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437C - Repainting Balls

We start with a collection of balls colored red, yellow, and green, with counts a, b, and c. We are allowed to repeatedly pick any single ball and repaint it into one of the other two colors.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437B - Two Screens

We are given two target strings, one that must end up on the first screen and another that must end up on the second screen. Both screens start empty.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › ICPC 2024-2025 NERC, Southern and Volga Russia Qualifier ›

CF 105437A - Cutting into Parts

We are given a single sheet and we repeatedly split it using full-length straight cuts. Every cut either goes from left to right across the entire current sheet or from top to bottom across the entire current sheet.
codeforces competitive-programming Jun 23, 2026