SCPC Teens 2025

13 problems from SCPC Teens 2025 (contest 106107), difficulty -. 13/13 solutions verified against sample I/O.

13 items

SCPC Teens 2025

Special | 13 problems | 13/13 verified | Difficulty - | 12m 14s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Zigzag Parity				54s	✓
B	CoCo Count				1m 4s	✓
C	DGeneral Hamilton's Cubes				58s	✓
D	Toward Divisibility				55s	✓
E	Permutation XORpectation				53s	✓
F	A bitty problem				52s	✓
G	Count the squares				55s	✓
H	String Partition				1m 14s	✓
I	Binary Reverser				54s	✓
J	Down the rabbit hole we go!				59s	✓
K	Least Common Route				51s	✓
L	Integer Average				55s	✓
M	Roots of Exclusion				50s	✓

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107M - Roots of Exclusion

We are given an array of values assigned to nodes, and we must build a rooted tree on the same set of nodes so that each node’s value matches a very specific structural property of the tree: the value at node x must equal the mex of all values that appear in the subtree of x.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107D - Toward Divisibility

We are given an array of integers and are allowed to perform at most one global modification of a very specific type. In that operation, we pick some subset of positions and add the same integer value to every element in that subset.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107H - String Partition

We are given a string and we want to split it into contiguous pieces. Every piece must satisfy a very rigid internal structure: there exists a single integer $x$ (the same for all pieces in a test case) such that inside each piece, every character that appears does so exactly…

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107C - DGeneral Hamilton's Cubes

We are building a large cube of size $n times n times n$ from $n^3$ identical unit cubes. Every small cube has its six faces permanently labeled with the numbers 1 through 6, one label per face.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107K - Least Common Route

We are given a tree where each node carries a positive integer value. For any pair of nodes $u$ and $v$, we look at the unique simple path connecting them in the tree and collect all node values along that path. From these values we compute their LCM.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107G - Count the squares

We are given several test cases. In each test case there is a collection of squares, each square having an integer side length.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107L - Integer Average

We are given several test cases. In each test case, there is an array of positive integers, and the task is to determine whether we can pick a subsequence of length at least two whose average value is an integer.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107J - Down the rabbit hole we go!

We are simulating a population of rabbits that evolves over time with two independent behaviors. We start with two fully grown rabbits on day zero.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107I - Binary Reverser

We are given an array of numbers and a binary string of the same length. We process indices from left to right. At position i, if the binary character is 1, we take the prefix of the array from 1 to i and reverse it in place; otherwise we do nothing.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107F - A bitty problem

We are given an integer array, and we are allowed to modify its elements. The goal is to make the array follow a very rigid structure: every pair of adjacent elements must have the same XOR value.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107E - Permutation XORpectation

We are given a length $n$, and we consider all permutations of the numbers from $1$ to $n$. For each permutation $p$, we define its score as the sum of bitwise XORs between adjacent elements, meaning we look at $p1 oplus p2 + p2 oplus p3 + dots + p{n-1} oplus pn$.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107B - CoCo Count

We are given two arrays of the same length, and we want to count subarrays based on a relationship between values in the first array and values in the second array over the same segment.

Practice › Codeforces Solutions › SCPC Teens 2025 ›

CF 106107A - Zigzag Parity

We are asked to construct a permutation of numbers from 1 to n such that consecutive triples behave in a very specific alternating way when viewed through parity of adjacent sums.