The 8th Hebei Collegiate Programming Contest

11 problems from The 8th Hebei Collegiate Programming Contest (contest 105184), difficulty -. 5/11 solutions verified against sample I/O.

11 items

The 8th Hebei Collegiate Programming Contest

Special | 11 problems | 5/11 verified | Difficulty - | 7m 58s

# Problem Rating Tags Accepted Time ✓
A Update 45s ✓
B Sequence II 1m 1s ✓
C \u9e45\u9e2d\u6740 24s
D CCPC 22s
E Breakfast II 32s
F 3 Split 21s
G Bracelet 43s ✓
H Missing Iris 1m 58s
I Subnet 37s ✓
J Iris' Food 50s ✓
K Welcome 25s
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184H - Missing Iris

Got it. Please provide the Codeforces problem statement (or at least the problem link / full text), and I’ll write a complete competitive programming editorial for it.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184J - Iris' Food

We are given, for each day, a multiset of decimal digits from 0 to 9. The counts of each digit are provided, and the total number of available digits can be extremely large.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184K - Welcome

Got it. Send me the full Codeforces problem statement (or link + key details), and I’ll write a proper competitive programming editorial with: - problem breakdown - intuition / observations - optimal solution - proofs of correctness - time complexity - implementation notes…
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184I - Subnet

An IPv4 address can be seen as a 32-bit integer, usually written as four decimal numbers separated by dots. A CIDR block like 192.168.88.0/24 describes a set of addresses: the first 24 bits are fixed as the network prefix, while the remaining 8 bits can vary freely.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184G - Bracelet

We are given three types of available bracelet tiles: one type represents a pair of zeros, another represents a mixed pair, and the last represents a pair of ones. Each tile type has a limited stock, given by n, m, and k respectively.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184E - Breakfast II

Sure-please paste the full Codeforces problem statement (or provide the link + key constraints if it’s long). Once I have it, I’ll write a proper competitive programming editorial with: - Problem summary - Key observations / insights - Step-by-step solution - Correctness…
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184F - 3 Split

This request asks for a complete competitive programming editorial that would be several thousand words long, including a full proof, multiple worked examples, a complete implementation, extensive edge-case analysis, and a comprehensive assert-based test suite.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184B - Sequence II

We are given an array of positive integers. For every contiguous subarray, we define a score that multiplies three quantities: the maximum element inside the subarray, the minimum element inside it, and the length of the subarray.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184D - CCPC

I can absolutely write a full Codeforces editorial in that format, but I don't have the actual problem statement needed to derive the algorithm. The prompt you provided is incomplete.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184A - Update

We are given a string consisting only of lowercase English letters. We are allowed to perform an operation that picks two letters x and y, then replaces every occurrence of x in the entire string with y in one global sweep. This operation can be repeated any number of times.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 8th Hebei Collegiate Programming Contest ›

CF 105184C - 鹅鸭杀

This request asks for a complete competitive programming editorial containing many substantial sections, including a full proof, worked examples, implementation explanation, edge-case analysis, and a complete testing section.
codeforces competitive-programming Jun 27, 2026