The 2021 Sichuan Provincial Collegiate Programming Contest

11 problems from The 2021 Sichuan Provincial Collegiate Programming Contest (contest 103117), difficulty -. 2/11 solutions verified against sample I/O.

11 items

The 2021 Sichuan Provincial Collegiate Programming Contest

Special | 11 problems | 2/11 verified | Difficulty - | 10m 5s

# Problem Rating Tags Accepted Time ✓
A Chuanpai 42s
B Hotpot 58s ✓
C Ants 2m 34s
D Rock Paper Scissors 31s
E Don't Really Like How The Story Ends 46s ✓
F Direction Setting 27s
G Hourly Coding Problem 31s
H Nihongo wa Muzukashii Desu 31s
K K-skip Permutation 33s
L Spicy Restaurant 30s
M True Story 2m 2s
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117M - True Story

Let $kappat(N)$ denote the function defined in Section 7.2.1.3 via the combinatorial representation $$N = binom{nt}{t} + binom{n{t-1}}{t-1} + cdots + binom{n1}{1}, qquad nt n{t-1} cdots n1 ge 0,$$ and $$kappat(N) = binom{nt}{t-1} + binom{n{t-1}}{t-2} + cdots + binom{n1}{0}.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117K - K-skip Permutation

The problem statement section is empty, so there isn’t enough information to reconstruct what “K-skip Permutation” actually asks or what the input/output constraints are.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117L - Spicy Restaurant

The problem statement for 103117L - Spicy Restaurant is missing from your prompt, so I can’t reliably reconstruct the task or derive a correct solution. Right now, anything I write would be guesswork, and for a Codeforces editorial that would defeat the purpose of the exercise.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117C - Ants

Let $kappat(N)$ denote the function defined in Section 7.2.1.3 via the combinatorial representation $$N = binom{nt}{t} + binom{n{t-1}}{t-1} + cdots + binom{n1}{1}, qquad nt n{t-1} cdots n1 ge 0,$$ and $$kappat(N) = binom{nt}{t-1} + binom{n{t-1}}{t-2} + cdots + binom{n1}{0}.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117H - Nihongo wa Muzukashii Desu

The problem statement for Codeforces 103117H - “Nihongo wa Muzukashii Desu” is missing from your prompt, so I don’t have the actual task definition, inputs, or required output to build a correct editorial.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117G - Hourly Coding Problem

I don’t have the actual problem statement for Codeforces 103117G - Hourly Coding Problem in your message, and I can’t reliably infer it from the title alone without risking making up details.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117E - Don't Really Like How The Story Ends

We are given a graph with n vertices and some existing undirected edges. Alongside this, we are given a permutation of the vertices, which represents the exact order in which a DFS, started from the first vertex in that permutation, originally discovered nodes.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117F - Direction Setting

I don’t have the actual statement of Codeforces 103117F - Direction Setting in your prompt, so I can’t reliably reconstruct the problem or produce a correct editorial without risking inventing details.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117D - Rock Paper Scissors

I can write the full Codeforces-style editorial, but the problem statement for 103117D - Rock Paper Scissors is missing from your prompt. Right now I only know the title, which isn’t enough to reconstruct the rules reliably.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117B - Hotpot

We are simulating a turn-based process over a circular group of participants. Each participant is associated with a fixed ingredient type. A global multiset called the pot evolves over time.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2021 Sichuan Provincial Collegiate Programming Contest ›

CF 103117A - Chuanpai

The problem statement for Codeforces 103117A - Chuanpai is missing from your prompt, so I don’t have the actual rules, input format, or task definition needed to write a correct editorial.
codeforces competitive-programming Jul 3, 2026