PPSC 2025

8 problems from PPSC 2025 (contest 105863), difficulty -. 7/8 solutions verified against sample I/O.

8 items

PPSC 2025

Special | 8 problems | 7/8 verified | Difficulty - | 14m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Reflecting				46s	✓
B	Numbers on the Blackboard				8m 29s
C	Leafy Distance				52s	✓
D	Counting Minimal Graphs				48s	✓
E	Partitioning				42s	✓
F	Modular Madness				48s	✓
G	A Counting Problem				47s	✓
H	Maximizing Pairs				59s	✓

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863B - Numbers on the Blackboard

Codeforces 105863B: Numbers on the Blackboard

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863H - Maximizing Pairs

We are given a multiset of integers. The task is not about sorting or selecting elements directly, but about understanding how these values interact when forming pairs whose sum is fixed.

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863A - Reflecting

We are working on a coordinate system where each move is not a standard step but a reflection-like transformation.

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863G - A Counting Problem

We are given a fixed number of positions and a range of values, and we conceptually assign values from this range to each position.

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863E - Partitioning

We are given an array of positive integers and we need to evaluate a function that depends on splitting this array into contiguous blocks.

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863D - Counting Minimal Graphs

We are given an undirected graph structure implicitly described through distances from a fixed root node, node 1.

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863F - Modular Madness

We are given a sequence of numbers and a sequence of modulo operations that are applied to them. Each time a number is processed with a modulus value, it is replaced by its remainder.

Practice › Codeforces Solutions › PPSC 2025 ›

CF 105863C - Leafy Distance

We are given a tree, meaning a connected graph with no cycles. Some vertices of this tree are leaves, vertices with degree one.