International MathCoding Narxoz open olympiad 2025

10 problems from International MathCoding Narxoz open olympiad 2025 (contest 106100), difficulty -. 5/10 solutions verified against sample I/O.

10 items

International MathCoding Narxoz open olympiad 2025

Special | 10 problems | 5/10 verified | Difficulty - | 7m 2s

# Problem Rating Tags Accepted Time ✓
A Minimizing Inversions with a Predetermined Prefix 46s ✓
B Goal in 3D 1m 6s ✓
C Cryptographic Trace 1m ✓
D Same Lectures 23s
E Balloons 43s ✓
F Unlock the Chest 26s
G Transformable Segment 1m 30s ✓
H The Magic of Squares 19s
I M.M.A 25s
J Portals in Narxoz 24s
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100G - Transformable Segment

We are given a long array A and a target array B. For any chosen segment A[L..R], we are allowed to repeatedly delete elements until the segment length becomes m = The task is to count how many segments of A can be transformed into exactly B.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100J - Portals in Narxoz

The problem statement is missing, so I can’t reconstruct the intended solution or write a correct editorial. “Portals in Narxoz” alone isn’t enough to infer the graph structure, constraints, or required output reliably, and guessing would lead to a fabricated editorial.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100I - M.M.A

I can't write a correct editorial for Codeforces 106100I - M.M.A from the information provided here because the actual problem statement, input format, output format, and constraints are missing.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100H - The Magic of Squares

I can’t reliably write a correct editorial for this problem yet because the statement section is missing. Right now there’s no description of what “The Magic of Squares” actually asks for, what inputs look like, or what needs to be computed, so any solution I write would…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100E - Balloons

We are given a row of balloons represented by a string consisting of the characters B and R. A configuration is considered correct when every red balloon has a blue balloon immediately before it. In string terms, every occurrence of R must satisfy two conditions: 1.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100F - Unlock the Chest

I can absolutely write that editorial in the requested style, but I’m missing the one thing that determines everything: the actual problem statement for Codeforces 106100F - Unlock the Chest.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100D - Same Lectures

Sure - please provide the Codeforces problem statement (or the problem link/problem ID), and I'll write a full competitive programming editorial in the style commonly seen on Codeforces, including: - Problem observation and intuition - Key lemmas/proofs - Derivation of the…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100B - Goal in 3D

The problem describes a point moving in three-dimensional space under constant horizontal velocity and vertical motion influenced by gravity.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100C - Cryptographic Trace

We are given a binary string s and a binary pattern t. We may flip any characters of s. Each flip changes a 0 into 1 or a 1 into 0, and costs one unit.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › International MathCoding Narxoz open olympiad 2025 ›

CF 106100A - Minimizing Inversions with a Predetermined Prefix

We are given the first m elements of a permutation of numbers 1...n. These elements are fixed and cannot be changed. The remaining n - m positions must be filled using exactly the numbers that do not appear in the fixed prefix.
codeforces competitive-programming Jun 25, 2026