XXII Open Cup, Grand Prix of Southeastern Europe

14 problems from XXII Open Cup, Grand Prix of Southeastern Europe (contest 103439), difficulty -. 1/14 solutions verified against sample I/O.

14 items

XXII Open Cup, Grand Prix of Southeastern Europe

Special | 14 problems | 1/14 verified | Difficulty - | 8m 31s

# Problem Rating Tags Accepted Time ✓
A ABC Legacy 30s
B New Queries On Segment Deluxe 2m 11s
C Counting Phenomenal Arrays 31s
D LIS Counting 27s
E Flood Fill 25s
F to Pay Respects 26s
G Replace Sort 51s ✓
H Werewolves 25s
I Colourful Permutation Sorting 29s
J Jason ABC 30s
K Amazing Tree 26s
L Primes and XOR? Nonsense 28s
M Many LCS 24s
N Max Pair Matching 28s
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439M - Many LCS

I can write the full editorial in exactly that format, but I’m missing the actual problem statement for Codeforces 103439M - Many LCS.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439N - Max Pair Matching

I’m missing the actual problem statement for Codeforces 103439N - Max Pair Matching (your prompt shows the section empty), so I can’t safely reconstruct the intended solution.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439K - Amazing Tree

I don’t have the actual statement for Codeforces 103439K - Amazing Tree in your prompt, and the “Problem Statement” section is empty.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439L - Primes and XOR? Nonsense

I don’t have the actual statement for Codeforces 103439L (“Primes and XOR? Nonsense”) in the prompt, and the task explicitly requires restating the problem, deriving constraints, and building correctness arguments from it.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439J - Jason ABC

I can’t reliably write a correct editorial for “Codeforces 103439J - Jason ABC” because I don’t have the problem statement, and I don’t want to invent details and accidentally give you a wrong solution.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439I - Colourful Permutation Sorting

I can’t reliably write a correct editorial without the actual problem statement. Right now the prompt only includes the title, but the core of the task, what operations are allowed, what “colourful permutation sorting” means in this context, and what constraints drive…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439B - New Queries On Segment Deluxe

Let the given bit string be $a{25}dots a0$, where $s=12$ zeros and $t=14$ ones. In Chase’s sequence $C{st}$ as defined in (41), successive combinations are obtained by exchanging an adjacent pattern $10 leftrightarrow 01$, so a single move swaps a $1$ with a neighboring $0$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439G - Replace Sort

We are given an array $A$ that we want to transform into a nondecreasing sequence. Alongside it, we have a separate set $B$ of spare values. Every element across $A$ and $B$ is distinct.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439H - Werewolves

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 103439H - Werewolves” alone isn’t enough to reliably reconstruct the task.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439F - to Pay Respects

I can’t reliably write a correct editorial for this because the actual problem statement is missing from your prompt. Right now I only have the title “103439F - to Pay Respects”, but no description of: - what the structure is (array, tree, graph, etc.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439D - LIS Counting

I can write a full editorial in the requested style, but I’m missing the most important piece: the actual problem statement for Codeforces 103439D - LIS Counting is not included in your prompt.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439E - Flood Fill

I can write the full editorial, but the problem statement section you provided is missing entirely (it’s blank). Without the actual rules of Codeforces 103439E - Flood Fill, I can’t accurately reconstruct the algorithm, examples, or edge cases without guessing.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439C - Counting Phenomenal Arrays

I can’t reliably write a correct editorial yet because the actual problem statement is missing from your prompt (the “Problem / Input / Output” sections are empty).
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Southeastern Europe ›

CF 103439A - ABC Legacy

I can’t reliably write a correct editorial yet because the actual problem statement for Codeforces 103439A - ABC Legacy is missing from your prompt.
codeforces competitive-programming Jul 3, 2026