The 14th Chinese Northeast Collegiate Programming Contest

12 problems from The 14th Chinese Northeast Collegiate Programming Contest (contest 102801), difficulty -. 11/12 solutions verified against sample I/O.

12 items

The 14th Chinese Northeast Collegiate Programming Contest

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

# Problem Rating Tags Accepted Time ✓
A Micro Structure Thread 4m 16s ✓
B Team 1m 10s ✓
C Function 1m 54s ✓
D Fall Guys 1m 9s ✓
E Liner vectors 54s ✓
F Splendor 47s
G Halli Galli 4m 26s ✓
H PepperLa's String 1m 7s ✓
I PepperLa's Cram School 1m 37s ✓
J Color the blocks 1m 13s ✓
K PepperLa's Boast 2m 8s ✓
L PepperLa's Express 2m 7s ✓
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801K - PepperLa's Boast

The problem describes a runner moving through a burning grid. The runner starts at the top left cell and needs to reach the bottom right cell. Each cell contains an amount of fresh air.
codeforces competitive-programming Aug 1, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801C - Function

The problem defines a transformation on a positive integer. For a number x, take every suffix of its decimal representation, multiply all those suffix values together, and reduce the product modulo x + 1. This result is f(x).
codeforces competitive-programming Aug 1, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801F - Splendor

I can write the full editorial, but the problem statement for Codeforces 102801F - Splendor is missing from the prompt, and I could not reliably recover the statement from the problem ID alone.
codeforces competitive-programming Aug 1, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801I - PepperLa's Cram School

The problem describes a set of classrooms connected by roads. Every pair of classrooms has a possible direct road of the same cost, but initially none of these roads are lit. Lighting a road costs one dollar.
codeforces competitive-programming Jul 30, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801G - Halli Galli

Halli Galli is a simulation problem about several players revealing fruit cards one by one. The players act cyclically, so after the last player takes a turn, the first player starts again.
codeforces competitive-programming Jul 30, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801A - Micro Structure Thread

The problem gives a set of distinct integers representing the important points of a binary space. The distance between two chosen points is the number of bit positions where their binary representations differ, which is the popcount of their XOR.
codeforces competitive-programming Jul 30, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801L - PepperLa's Express

The problem describes a three-dimensional city represented by an n × m × k grid. Some cells contain existing post offices, some cells contain houses, and the remaining cells are empty land. We may build exactly one additional post office on an empty cell.
codeforces competitive-programming Jul 28, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801J - Color the blocks

The grid is an (N times N) board. Every cell can be painted either black or white. Some pairs of cells are connected by a restriction: the two cells in such a pair are not allowed to have the same color.
codeforces competitive-programming Jul 28, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801H - PepperLa's String

We are given a lowercase string that can be compressed by replacing any consecutive block of equal letters with the letter followed by the block length written in hexadecimal. A block of length one is not followed by a number.
codeforces competitive-programming Jul 28, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801E - Liner vectors

The problem asks whether a vector B can be obtained from an initial vector A by repeatedly applying two allowed moves: rotate the current vector 90 degrees clockwise, or add a fixed vector C to the current vector.
codeforces competitive-programming Jul 28, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801D - Fall Guys

We have a group of players trying to grab a moving crown. The crown does not stay still: it starts at height 0, moves upward until height H, then moves downward until height 0, and repeats this motion forever.
codeforces competitive-programming Jul 28, 2026
Practice › Codeforces Solutions › The 14th Chinese Northeast Collegiate Programming Contest ›

CF 102801B - Team

We have three groups of students, called A, B, and C, each containing n students. Every student has an ability value. A team must contain exactly one student from each group. The score of a team is determined by the interaction between the A student and the other two members.
codeforces competitive-programming Jul 28, 2026