The 10th Shandong Provincial Collegiate Programming Contest

13 problems from The 10th Shandong Provincial Collegiate Programming Contest (contest 104459), difficulty -. 11/13 solutions verified against sample I/O.

13 items

The 10th Shandong Provincial Collegiate Programming Contest

Special | 13 problems | 11/13 verified | Difficulty - | 14m 10s

# Problem Rating Tags Accepted Time ✓
A Sekiro 49s ✓
B Median 1m 23s ✓
C Tokens on the Segments 2m
D Stones in the Bucket 47s ✓
E BaoBao Loves Reading 53s ✓
F Game on a Graph 59s ✓
G Heap 52s ✓
H Wandering Robot 54s ✓
I Connected Intervals 1m 5s ✓
J Triangle City 54s ✓
K Happy Equation 52s ✓
L Flipping Game 45s ✓
M Calandar 1m 57s
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459M - Calandar

There isn’t enough consistent information here to actually diagnose a “logic bug,” because the “input” you’re giving is not a well-formed instance of any single Codeforces problem.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459L - Flipping Game

We are given a set of variables, each representing a hidden number. We do not know their values, but we are given a collection of strict ordering constraints of the form “variable a is strictly greater than variable b”.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459K - Happy Equation

We are given a modular equation involving an integer parameter $a$ and an exponent parameter $p$. For each test case, we consider all integers $x$ in the range from $1$ to $2^p$, and we need to count how many of them satisfy a congruence where two very different expressions…
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459J - Triangle City

The input describes a triangular grid of intersections. Row $i$ contains $i$ nodes, so the total number of nodes is $n(n+1)/2$. We always start at the top node $(1,1)$ and want to reach the bottom-right node $(n,n)$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459I - Connected Intervals

We are given a tree whose vertices are labeled from 1 to n. The labels themselves define a linear order, and we are asked to look at every interval of labels [l, r].
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459H - Wandering Robot

We are given several horizontal segments drawn on a grid. Each segment lies on a distinct horizontal line: the i-th segment sits at height y = i and spans from x = li to x = ri, covering all integer x between those endpoints.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459G - Heap

We are given a sequence of values inserted one by one into a binary heap structure, starting from an empty array. Each insertion uses a “bubble-up” procedure, but the direction of the heap property is not fixed.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459F - Game on a Graph

We are given several independent test cases. Each test case consists of a sequence of buckets, where each bucket holds a non-negative number of stones.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459E - BaoBao Loves Reading

We are given a sequence of book requests over time, where each request asks for a specific book. There is a small desk that can hold at most $k$ distinct books at any moment. Initially, the desk is empty. When a book is requested, two things can happen.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459C - Tokens on the Segments

There isn’t enough consistent information here to actually diagnose a “logic bug,” because the “input” you’re giving is not a well-formed instance of any single Codeforces problem.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459D - Stones in the Bucket

We are given a connected undirected graph and a sequence of players who take turns in a fixed cycle. Each move consists of removing a single edge from the graph. The only constraint is that the graph must remain connected after the removal.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459B - Median

We are given a system of n independent switches controlling n lights. Each light starts in an initial state and must reach a target state after exactly k rounds of operations.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 10th Shandong Provincial Collegiate Programming Contest ›

CF 104459A - Sekiro

We are working on a fictional calendar system where time is fully regular. Each year has exactly 12 months, each month has exactly 30 days, and weeks repeat every 5 days in a fixed cycle from Monday through Friday. For each test case, we are given two dates in this calendar.
codeforces competitive-programming Jun 30, 2026