The 2021 Shanghai Collegiate Programming Contest

12 problems from The 2021 Shanghai Collegiate Programming Contest (contest 103186), difficulty -. 10/12 solutions verified against sample I/O.

12 items

The 2021 Shanghai Collegiate Programming Contest

Special | 12 problems | 10/12 verified | Difficulty - | 11m 39s

# Problem Rating Tags Accepted Time ✓
A \u5c0f A \u7684\u70b9\u9762\u8bba 49s ✓
B \u5c0f A \u7684\u5361\u724c\u6e38\u620f 56s
C \u5c0f A \u7684\u671f\u672b\u8003\u8bd5 52s ✓
D Zztrans \u7684\u73ed\u7ea7\u5408\u7167 57s ✓
E Zztrans \u7684\u5e84\u56ed 48s ✓
F \u9e21\u54e5\u7684\u9650\u5e01\u4ee4 2m 27s
G \u9e21\u54e5\u7684\u96d5\u50cf 46s ✓
H \u9e21\u54e5\u7684 AI \u9a7e\u9a76 50s ✓
I \u5bf9\u7ebf 49s ✓
J Alice and Bob-1 44s ✓
K Alice and Bob-2 45s ✓
L \u9ad8\u4f4e\u5965\u9a6c\u54c8\u6251\u514b 56s ✓
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186L - 高低奥马哈扑克

We are given a simplified but fully specified game state from Omaha Hi / Lo poker. For each test case, two players, Alice and Bob, each have four private cards, and there are five shared community cards.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186K - Alice and Bob-2

We are given several independent games. Each game consists of a small collection of strings made of lowercase letters.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186F - 鸡哥的限币令

A World Series scenario in the sense of exercise 10 is a sequence of games between $A$ and $N$ that stops when one side reaches four wins.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186J - Alice and Bob-1

We are given a sequence of integers representing card values laid out in a row. Two players, Alice and Bob, alternately pick one card per turn until all cards are taken. Alice always moves first.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186I - 对线

We maintain three parallel arrays of length $n$, each position representing a lane on a battlefield. Initially all values are zero.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186H - 鸡哥的 AI 驾驶

We are given a set of cars moving along a single infinite line. Each car starts at an integer position, moves with a constant integer velocity, and belongs to a type.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186G - 鸡哥的雕像

We are given an array of $n$ positive integers, where each value represents the “growth level” of a plant placed along a street.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186D - Zztrans 的班级合照

We are given a multiset of students, each with an integer “height rank” where equal values mean equal height. The task is to arrange all students into two rows of equal length. If there are $n$ students, both rows contain $n/2$ positions indexed from left to right.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186E - Zztrans 的庄园

We are simulating a simplified fishing system where each cast produces exactly one fish according to a known probability distribution over fish types.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186B - 小 A 的卡牌游戏

Let the canonical bases be represented in the form $(alpha1,dots,alphat)$ as in exercise 12, where each $alphai$ is a binary string of length $n$ with exactly one distinguished position equal to $1$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186C - 小 A 的期末考试

We are given a group of students, each identified by a unique student ID and an initial score. Among them, one student is special, denoted by index m in the input order, and we call this student Xiao A.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Shanghai Collegiate Programming Contest ›

CF 103186A - 小 A 的点面论

We are given two vectors in three-dimensional space, each described by three integer coordinates. The task is to construct any non-zero integer vector that is perpendicular to both given vectors at the same time.
codeforces competitive-programming Jul 3, 2026