2022 Jiangsu Collegiate Programming Contest

12 problems from 2022 Jiangsu Collegiate Programming Contest (contest 103743), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2022 Jiangsu Collegiate Programming Contest

Special | 12 problems | 12/12 verified | Difficulty - | 12m 16s

# Problem Rating Tags Accepted Time ✓
A PENTA KILL! 52s ✓
B Prime Ring Plus 54s ✓
C Jump and Treasure 1m 5s ✓
D Finding Pairs 1m 12s ✓
E Playing Cards 50s ✓
F Pockets 1m 12s ✓
G GCD on Bipartite Graph 1m 15s ✓
H Super Gray Pony 1m ✓
I Cutting Suffix 54s ✓
J Balanced Tree 56s ✓
K aaaaaaaaaaA heH heH nuN 53s ✓
L Collecting Diamonds 1m 13s ✓
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743L - Collecting Diamonds

We are given a string made only of the characters A, B, and C. You should think of it as a row of diamonds arranged left to right. The process allows us to repeatedly pick a consecutive block of three diamonds forming the pattern A, B, C in the current configuration.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743J - Balanced Tree

We are counting binary tree shapes under a strict structural rule. Each node either has two subtrees or none, and what matters is not keys or labels but only how many nodes are inside each subtree.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743K - aaaaaaaaaaA heH heH nuN

We are given multiple queries, each asking us to construct a string over lowercase English letters such that the number of special subsequences inside that string equals a given integer $n$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743G - GCD on Bipartite Graph

We are given a complete bipartite graph, meaning every vertex on the left side is connected to every vertex on the right side, and there are no edges inside a side. We are also given the numbers from 1 to n + m, and we must place each number exactly once on one of the vertices.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743I - Cutting Suffix

We are given a single lowercase string of length $n$. From this string, we consider every suffix, meaning for each position $i$, we look at the substring starting at $i$ and continuing to the end.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743H - Super Gray Pony

We are given a recursively defined ordering of all binary strings of length $n$. This ordering is the classic Gray code construction: for $n=1$ it is simply $0,1$, and for larger $n$ it is built by taking the previous sequence, prefixing all elements with $0$, then taking the…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743D - Finding Pairs

We are working with an array of values indexed from 1 to n, where each index carries a weight. For each query, we are given a segment of indices from l to r, and we are allowed to pick some indices from this segment and arrange them into pairs.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743F - Pockets

We are given several types of items, each type having a value and a weight, and we can pick items repeatedly, including picking the same type multiple times. A shopping plan is an ordered sequence of picks, and each pick chooses one item type independently.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743E - Playing Cards

We are given two arrays of length $n$. Alice has $n$ cards with fixed values, and Bob also has $n$ cards but plays them in a fixed order. Over $n$ rounds, Alice is allowed to choose the order in which she plays her cards. In each round, the two revealed values are compared.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743C - Jump and Treasure

We are given a one-dimensional game world with positions on the integer line. There are pillars at coordinates from 0 to n, where pillar i has a treasure value ai for i ≥ 1, while pillar 0 is the starting point and has no treasure.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743B - Prime Ring Plus

We are asked to take all integers from 1 to n and partition them into several cycles. A cycle is an ordered sequence, and every number must appear in exactly one cycle.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Jiangsu Collegiate Programming Contest ›

CF 103743A - PENTA KILL!

We are given a chronological log of kill events in a match. Each event states that one player eliminates another player. Although the victim immediately respawns and can be killed again, we only care about the sequence of who killed whom over time.
codeforces competitive-programming Jul 2, 2026