The 19th Heilongjiang Provincial Collegiate Programming Contest

12 problems from The 19th Heilongjiang Provincial Collegiate Programming Contest (contest 105163), difficulty -. 7/12 solutions verified against sample I/O.

12 items

The 19th Heilongjiang Provincial Collegiate Programming Contest

Special | 12 problems | 7/12 verified | Difficulty - | 8m 25s

# Problem Rating Tags Accepted Time ✓
A Fixing Tube 50s ✓
B String 55s ✓
C Monster Hunt 23s
D Card Game 56s ✓
E Three Kingdoms 47s ✓
F Photography 48s ✓
G Grey-like Code 35s
H Color of Goods 53s ✓
I This is an easy problem 32s
J Trade 37s
K Puzzle 19s
L Badminton 50s ✓
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163L - Badminton

We are given a directed graph where each node has an associated value that can be interpreted as a capacity or weight. Some nodes are marked as active depending on a parameter that can be adjusted.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163K - Puzzle

Codeforces 105163K: Puzzle
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163J - Trade

We are working on a grid where each cell has two kinds of values. One value represents how much it costs to pass through that cell, and the other represents the price at which goods can be sold in that cell.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163H - Color of Goods

Each item in the input can be seen as a “colored object”, except a single object may carry multiple colors at once.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163I - This is an easy problem

The task is centered around inspecting the binary representation of an integer and reasoning about individual bits.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163G - Grey-like Code

The construction defines a directed graph built from bit manipulation. Each vertex is an integer in a full range that can be interpreted as a fixed-length binary string.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163F - Photography

The problem describes a selection process on a structure that can be interpreted as a graph or a sequence of connected points.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163E - Three Kingdoms

The problem describes a probabilistic card process involving two players, Joey and Grey, where the final expected number of cards depends on both the initial composition of suits and a recursive interaction between outcomes.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163D - Card Game

Two players each hold a collection of cards, and every card is either offensive or defensive. Each card also has a single numeric attribute, its attack value.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163B - String

We are given a single string consisting of characters, and we repeatedly apply a local reduction rule until no more changes are possible. The rule is simple: whenever three identical characters become adjacent, they disappear from the string.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163A - Fixing Tube

We are given a grid-like pipeline system made of four types of pipe tiles. Each tile can potentially be rotated, and water enters from a starting point and must be routed through connected tiles according to their shapes.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 19th Heilongjiang Provincial Collegiate Programming Contest ›

CF 105163C - Monster Hunt

We are working on a rooted tree. During the process, some nodes become “active” through toggle operations. After
codeforces competitive-programming Jun 27, 2026