2022 Shanghai Collegiate Programming Contest

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

14 items

2022 Shanghai Collegiate Programming Contest

Special | 14 problems | 12/14 verified | Difficulty - | 11m 48s

# Problem Rating Tags Accepted Time ✓
A Another A+B Problem 53s ✓
B Bracket Query 53s ✓
C Coffee Overdose 50s ✓
D Demonstrational sequences 1m 1s ✓
E Expenditure Reduction 43s ✓
F Forest of Magic 30s
G Gua! 49s ✓
H Heirloom Painting 53s
I It Takes Two of Two 53s ✓
J Just Some Bad Memory 1m 11s ✓
K Known as the Fruit Brother 49s ✓
L Last Warning of the Competition Finance Officer 50s ✓
M My University Is Better Than Yours 51s ✓
N Nine Is Greater Than Ten 42s ✓
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931N - Nine Is Greater Than Ten

We are given two positive integers written in plain decimal form, each without leading zeros, and we need to compare them using a deliberately odd rule inspired by the story.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931M - My University Is Better Than Yours

We are given several complete rankings of the same set of universities. Each ranking is a permutation, ordered from best to worst.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931J - Just Some Bad Memory

We are given an undirected simple graph, meaning there are no self-loops and no duplicate edges. From this starting graph, we are allowed to add new edges between previously non-adjacent pairs of vertices, while keeping the graph simple.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931K - Known as the Fruit Brother

We are working in a 2D plane where movement is normally continuous and costs time proportional to Euclidean distance. The plane contains rectangular forbidden zones that cannot be entered, although their borders are allowed.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931L - Last Warning of the Competition Finance Officer

We are given a long lowercase string s. We process it from left to right, and after reading each prefix s[1..i], we must compute a score that depends on a dictionary of special words. Each dictionary word ti has an associated value vi.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931H - Heirloom Painting

A Morse code word of length $n$ is a sequence over the alphabet ${cdot, -}$ in which each dot contributes weight $1$ and each dash contributes weight $2$, and the total weight is exactly $n$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931I - It Takes Two of Two

We are simulating a random process that builds a graph on $n$ labeled vertices. The graph starts empty. In each iteration, we independently pick two vertices $u$ and $v$ uniformly from $1$ to $n$, allowing $u=v$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931G - Gua!

We are given a single weapon model described by two parameters and a replay of a match segment. The weapon deals at most $B$ damage per bullet and has a firing rate of $R$ rounds per minute. From this we can deduce how frequently bullets can be fired.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931E - Expenditure Reduction

We are given a source string $S$ and a target string $F$. The task is to cut out a contiguous segment of $S$, meaning a substring, such that $F$ can still be found inside that segment as a subsequence.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931F - Forest of Magic

A Morse code word of length $n$ is a sequence over the alphabet ${cdot, -}$ in which each dot contributes weight $1$ and each dash contributes weight $2$, and the total weight is exactly $n$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931D - Demonstrational sequences

We are given a deterministic sequence generator that starts from a value $a$ and repeatedly applies a quadratic transformation $x mapsto x^2 + b$. Each query defines one such infinite sequence.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931B - Bracket Query

We are given a hidden string of length $n$, where every character is either an opening bracket or a closing bracket. We do not see the string directly, but we are given a set of interval constraints.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931A - Another A+B Problem

We are given a fixed equation format of length 8, always written as two two-digit numbers added together and equated to another two-digit number. The structure is always ??+??=??, where each ? is a digit.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Shanghai Collegiate Programming Contest ›

CF 103931C - Coffee Overdose

We are modeling a process that runs for discrete seconds, where each second produces a reward equal to the current stamina value. The stamina starts at some initial value $S$, and naturally decreases by 1 each second as time passes.
codeforces competitive-programming Jul 2, 2026