Codeforces Global Round 9

7 problems from Codeforces Global Round 9 (contest 1375), difficulty 1100-3300. 1/7 solutions verified against sample I/O.

7 items

Codeforces Global Round 9

Global | 7 problems | 1/7 verified | Difficulty 1100-3300 | 27m 19s

# Problem Rating Tags Accepted Time ✓
A Sign Flipping 1100 constructive-algorithms, math 18,842 2m 18s
B Neighbor Grid 1200 constructive-algorithms, greedy 17,850 2m 18s
C Element Extermination 1400 constructive-algorithms, data-structures, greedy 22,944 2m 34s
E Inversion SwapSort 2500 constructive-algorithms, greedy, sortings 3,370 5m 30s ✓
F Integer Game 2600 constructive-algorithms, games, interactive 2,510 6m 23s
G Tree Modification 2800 brute-force, constructive-algorithms, dfs-and-similar 2,187 2m 29s
H Set Merging 3300 constructive-algorithms, divide-and-conquer 496 5m 47s
Practice › Codeforces Solutions › Codeforces Global Round 9 ›

CF 1375H - Set Merging

We are given a permutation of numbers from 1 to n, but the real object we care about is not the values themselves, it is their positions. Initially each position i forms a singleton set containing the value a[i].
codeforces competitive-programming constructive-algorithms divide-and-conquer Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Global Round 9 ›

CF 1375F - Integer Game

Three numbers represent the sizes of three piles of stones. The interaction alternates between us and the opponent.
codeforces competitive-programming constructive-algorithms games interactive math Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Global Round 9 ›

CF 1375E - Inversion SwapSort

We are given a sequence of numbers, and we are allowed to swap any two positions, but only if those two positions currently form an inversion in the original array. An inversion is simply a pair of indices where the left value is strictly larger than the right value.
codeforces competitive-programming constructive-algorithms greedy sortings Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Global Round 9 ›

CF 1375A - Sign Flipping

Stopped thinking
codeforces competitive-programming constructive-algorithms math Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Global Round 9 ›

CF 1375B - Neighbor Grid

We are given a grid of integers, but the final goal is not to preserve these values exactly. Instead, we are allowed to only increase values, and we want to transform the grid into a configuration where every positive cell behaves like a “node” whose value equals how many of…
codeforces competitive-programming constructive-algorithms greedy Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Global Round 9 ›

CF 1375G - Tree Modification

Let $Nge 1$ be fixed. An $m$-survivor is a positive integer all of whose prime factors exceed $m$. Let $$f(x,m)={nle x:text{$n$ is an $m$-survivor}},$$ and let $$fk(x,m)={nle x:text{$n$ is an $m$-survivor having exactly $k$ prime factors}},$$ where prime factors are counted…
codeforces competitive-programming brute-force constructive-algorithms dfs-and-similar graph-matchings graphs trees Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Global Round 9 ›

CF 1375C - Element Extermination

Let $Nge 1$ be fixed. An $m$-survivor is a positive integer all of whose prime factors exceed $m$. Let $$f(x,m)={nle x:text{$n$ is an $m$-survivor}},$$ and let $$fk(x,m)={nle x:text{$n$ is an $m$-survivor having exactly $k$ prime factors}},$$ where prime factors are counted…
codeforces competitive-programming constructive-algorithms data-structures greedy Jun 11, 2026