2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛）

12 problems from 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） (contest 106508), difficulty -. 5/12 solutions verified against sample I/O.

12 items

2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛）

Special | 12 problems | 5/12 verified | Difficulty - | 9m 12s

#	Problem	Time	✓
A	Basic Matrix Recurrence Practice	29s
B	The Light Boat Has Passed Ten Thousand Mountains	25s
C	Leyline Resonance	1m 14s	✓
D	SCUT Classroom Relocation	29s
E	Phantoms of the XOR Tree	1m 57s
F	PigeonG's Encoded Sequences	50s	✓
G	Delete or not	49s	✓
H	Substring Game	45s	✓
I	Parallel Pipeline Scheduling	30s
J	GCD and LCM Subsequences	45s	✓
K	Choose	29s
L	Matrix Construction	30s

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508J - GCD and LCM Subsequences

We are given a sequence of integers and we are asked to consider all its non-empty subsequences. For each subsequence, we compute two values: the greatest common divisor of all elements in it and the least common multiple of all elements in it.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508L - Matrix Construction

I cannot safely reconstruct the exact statement of “Codeforces 106508L - Matrix Construction” from the information available here.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508K - Choose

I can’t reliably reconstruct Codeforces 106508K - Choose from the title alone, and I don’t have the actual problem statement in the context you provided.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508I - Parallel Pipeline Scheduling

I don’t have the exact Codeforces statement text for 106508I - Parallel Pipeline Scheduling available from the sources I can reliably retrieve, so I can’t truthfully reconstruct its precise constraints or intended model without risking inventing details.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508H - Substring Game

We are given a game built on a single string of lowercase letters. Two players, Alice and Bob, take turns modifying the string until it becomes empty.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508E - Phantoms of the XOR Tree

Got it. Please send the full problem statement (or link/text, constraints, and any samples). Once I have that, I’ll write a proper Codeforces-style editorial with: - Intuition / key observation - Step-by-step solution - Correctness argument - Complexity analysis - Edge cases…

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508G - Delete or not

We are given a sequence of distinct values that is already sorted in increasing order. From any contiguous segment of this sequence, we are allowed to repeatedly remove elements as long as they satisfy a local convexity condition: an interior element can be deleted if it is…

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508F - PigeonG's Encoded Sequences

We are given a binary string, and we imagine splitting it into several contiguous pieces. Each piece is interpreted as a binary number using the usual left-to-right significance, meaning the leftmost character in the piece contributes the highest power of two.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508C - Leyline Resonance

We are given a rooted tree where every node already has a real-valued “desired level” written on it. We are allowed to assign a new real value to every node, and this assignment is what we are optimizing. Two kinds of costs interact.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508D - SCUT Classroom Relocation

I can’t reliably write a correct editorial yet because the problem statement for Codeforces 106508D - SCUT Classroom Relocation is not available in the context, and it does not appear in the retrieved sources.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508A - Basic Matrix Recurrence Practice

I can’t reliably write a correct editorial for this without the actual problem statement. “Codeforces 106508A - Basic Matrix Recurrence Practice” isn’t included in your prompt, and the sections (input/output/problem description) are empty.

Practice › Codeforces Solutions › 2026 SCUT Programming Contest（2026 华南理工大学程序设计校赛） ›

CF 106508B - The Light Boat Has Passed Ten Thousand Mountains

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 106508B - “The Light Boat Has Passed Ten Thousand Mountains” isn’t included, and I don’t have enough reliable information about what the task is to reconstruct it safely.