2021 Jiangxi Provincial Collegiate Programming Contest

12 problems from 2021 Jiangxi Provincial Collegiate Programming Contest (contest 103366), difficulty -. 8/12 solutions verified against sample I/O.

12 items

2021 Jiangxi Provincial Collegiate Programming Contest

Special | 12 problems | 8/12 verified | Difficulty - | 14m 28s

# Problem Rating Tags Accepted Time ✓
A Mio visits ACGN Exhibition 1m 47s
B Continued Fraction 48s ✓
C Crystal Caves 1m 13s ✓
D Character Distance 1m 2s ✓
E The Legend of God Flukehn in Eastern 52s ✓
F Four Column Hanoi Tower 2m 16s
G Magic Number Group 50s ✓
H Hearthstone So Easy 1m 44s
I Homework 1m 8s ✓
J LRU 49s ✓
K Many Littles Make a Mickle 1m 6s
L It Rains Again 53s ✓
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366H - Hearthstone So Easy

An (s, t)-combination $c4 c3 c2 c1$ with $t=4$ is a strictly decreasing 4-tuple $$n c4 c3 c2 c1 ge 0,$$ and the condition $c4 - c1 < m$ is equivalent to requiring that all selected elements lie in an interval of length $m-1$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366L - It Rains Again

We are given several line segments floating above an infinite horizontal ground line, which we can think of as the x-axis. Each segment represents a “rainscreen” placed somewhere in the plane, and rain falls strictly vertically downward from infinity.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366K - Many Littles Make a Mickle

An (s, t)-combination $c4 c3 c2 c1$ with $t=4$ is a strictly decreasing 4-tuple $$n c4 c3 c2 c1 ge 0,$$ and the condition $c4 - c1 < m$ is equivalent to requiring that all selected elements lie in an interval of length $m-1$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366J - LRU

We are simulating how a cache behaves under a Least Recently Used policy, but instead of directly simulating it for a fixed cache size, we are asked a reverse question: among all possible cache capacities, we want the smallest capacity such that the cache produces at least K…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366F - Four Column Hanoi Tower

An (s, t)-combination $c4 c3 c2 c1$ with $t=4$ is a strictly decreasing 4-tuple $$n c4 c3 c2 c1 ge 0,$$ and the condition $c4 - c1 < m$ is equivalent to requiring that all selected elements lie in an interval of length $m-1$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366I - Homework

We are given a tree of n students. Each student lives at a node, and each edge represents a bidirectional road with a travel time. Every student also has a personal time ai, meaning how long they need to finish homework on their own if they never copy from anyone else.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366G - Magic Number Group

We are given an array of positive integers. For each query, we focus on a contiguous segment of this array and try to find a single integer greater than one that divides as many numbers inside that segment as possible.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366E - The Legend of God Flukehn in Eastern

We are given an infinite integer grid. There are two kinds of pieces: several pawns controlled by us, and a single gold general controlled by the opponent. Each pawn starts at a fixed coordinate, while the gold general starts at the origin. The game evolves in alternating turns.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366D - Character Distance

We are given a multiset of integers, and we are allowed to rearrange them into any order. After rearrangement, we must guarantee the existence of at least one value, call it $x$, such that all occurrences of $x$ are sufficiently far apart: any two positions containing $x$ must…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366A - Mio visits ACGN Exhibition

An (s, t)-combination $c4 c3 c2 c1$ with $t=4$ is a strictly decreasing 4-tuple $$n c4 c3 c2 c1 ge 0,$$ and the condition $c4 - c1 < m$ is equivalent to requiring that all selected elements lie in an interval of length $m-1$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366C - Crystal Caves

We are given a stack of horizontal segments indexed from 1 to n, where the i-th segment lies at vertical level y = −i and allows us to choose a single point with x-coordinate anywhere inside a closed interval [li, ri].
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021 Jiangxi Provincial Collegiate Programming Contest ›

CF 103366B - Continued Fraction

We are given a positive rational number represented as a reduced fraction x/y, and we are asked to express it as a finite continued fraction.
codeforces competitive-programming Jul 3, 2026