2026 华南师范大学程序设计竞赛 (SCNUCPC 2026)

13 problems from 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) (contest 106503), difficulty -. 11/13 solutions verified against sample I/O.

13 items

2026 华南师范大学程序设计竞赛 (SCNUCPC 2026)

Special | 13 problems | 11/13 verified | Difficulty - | 12m 44s

#	Problem	Time	✓
A	Hello, SCNUCPC!	51s	✓
B	0100101	1m 2s	✓
C	Valentine's Day of Crime and Punishment	1m 5s	✓
D	Valentine's Day Money Tree	1m 3s	✓
E	Top Student Problem\u2160	44s	✓
F	Top Student Problem\u2161	25s
G	Destroy the NPS	1m 17s	✓
H	Hajimi's Rebellion	1m 35s
I	\u300cI\u300dnan desu	52s	✓
J	Stop, Grid Please No More	1m 11s	✓
K	NTT	50s	✓
L	As crychic wanes	50s	✓
M	Until next time, SCNUCPC!	59s	✓

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503D - Valentine's Day Money Tree

We are dealing with a two-phase communication game built around a tree. In the first phase, Alice sees a rooted tree with nodes labeled from 1 to n. She is allowed to perform a small number of operations on a screen that starts as a length-n array filled with zeros.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503J - Stop, Grid Please No More

We are given a rectangular grid of size $n times m$. Each cell is treated as a unit square, and each square is assigned one of four possible orientations, corresponding to one of the four directions on the grid.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503M - Until next time, SCNUCPC!

We are given a line of stalls indexed from left to right. Some positions are already fixed as active stalls, marked as C, while some positions are empty candidates marked as ?. We are allowed to turn some of the ?

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503K - NTT

We are given a polynomial described by its coefficients in increasing order of degree. In other words, the input defines a function F(x) = f0 + f1 x + f2 x^2 + ...

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503B - 0100101

We are given a binary string of length $n$. We must construct a sequence $a1, a2, dots, a{n+1}$, where each value is a small positive integer bounded by 100.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503G - Destroy the NPS

We are given a weighted undirected graph whose nodes store integer values. Every edge contributes a cost equal to the XOR of the values stored at its endpoints, and the total “energy” of the system is the sum of these edge costs. The system evolves through random operations.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503L - As crychic wanes

We are given a rooted tree with node 1 as the root. Each node has a weight, and on any given day, the weight of most nodes is fixed, but a small set of special nodes shares a single global value that can change each day.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503H - Hajimi's Rebellion

I’m sorry, but I can’t reliably write a complete editorial and accepted solution for this problem from the statement alone. This is a highly nontrivial dynamic-tree problem.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503I - 「I」nan desu

We are given a binary grid made of black and white cells. Each test case provides an $n times m$ matrix where each cell is either black () or white (.). The task is to count how many subrectangles of this grid form a special pattern called an “I”.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503E - Top Student ProblemⅠ

We are given a very small 3 × 3 grid where each cell contains a height value between 0 and 3. You can think of this as a top-down projection of a stack of unit cubes: at position (i, j), there are hi,j cubes stacked vertically.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503F - Top Student ProblemⅡ

We are given a rectangular grid of size $n times m$ where we may place stacks of unit cubes, so each cell contains a non-negative integer height. We do not see the grid directly. Instead, we are given two projections of the same 3D structure.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503C - Valentine's Day of Crime and Punishment

We are dealing with a 64 by 64 grid of bits, where each cell is either 0 or 1. Exactly one cell is special, and Alice is told its coordinates.

Practice › Codeforces Solutions › 2026 华南师范大学程序设计竞赛 (SCNUCPC 2026) ›

CF 106503A - Hello, SCNUCPC!

We are given a row of $n$ positions, each position either already fixed as the letter C or still empty, represented by ?. We must replace every ? with uppercase letters so that the final string contains exactly $k$ occurrences of the pattern SCNUCPC.