HPI 2026 Novice

10 problems from HPI 2026 Novice (contest 106410), difficulty -. 6/10 solutions verified against sample I/O.

10 items

HPI 2026 Novice

Special | 10 problems | 6/10 verified | Difficulty - | 5m 49s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Harker!!				27s
B	Yash is Cross-Eyed				34s	✓
C	Repetition				35s	✓
D	Skills				26s
E	String Runs				26s
F	The Penguin-Gopher Shuffle				31s	✓
G	Regina's Task				44s	✓
H	Tung Tung String				43s
I	Pace Pushers				43s	✓
J	Skating With Alysa Liu				40s	✓

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410J - Skating With Alysa Liu

We are given an array of integers representing some initial values on a line. Alongside this, there is a modulus parameter $m$, and a fixed window length $k$. We are allowed to perform an operation any number of times.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410I - Pace Pushers

We have a set of beacons placed on a line. Each beacon has a position and a current power. A beacon with power p covers the inclusive interval [x - p, x + p]. During every round, every pair of overlapping intervals with different powers causes the weaker beacon to gain one power.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410H - Tung Tung String

I can write the full editorial in that format, but I do not have enough information to identify the actual problem. The title and identifier you provided, Codeforces 106410H - Tung Tung String, do not match a publicly indexed Codeforces problem I can reliably retrieve.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410G - Regina's Task

We are given an undirected graph where each edge connects two distinct vertices and there are no repeated edges. The task is to find four different vertices such that consecutive pairs form edges: the first is connected to the second, the second to the third, and the third to…

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410F - The Penguin-Gopher Shuffle

We are given two strings, a and b, of the same length. The allowed operation is unusual: instead of swapping two characters or changing one position, we choose an index i and reverse everything from i to the end of the current string.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410E - String Runs

I can write the editorial, but the actual problem details are missing. The sections labeled “Problem Statement”, “Input”, and “Output” are empty, and I cannot reliably infer the requirements of Codeforces 106410E “String Runs” from the title alone.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410D - Skills

I can’t reliably reconstruct “Codeforces 106410D - Skills” from the identifier alone, and without the actual statement I’d risk writing an editorial for the wrong problem. What I need is one of the following: 1. The full problem statement (preferred), or 2.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410C - Repetition

The problem asks us to count how many subsequences of an array are valid. A subsequence is created by choosing some indices and keeping their original order.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410B - Yash is Cross-Eyed

We are given several strings. For each string, we may repeatedly swap two neighboring characters. The question is whether these swaps can transform the string into two identical consecutive parts.

Practice › Codeforces Solutions › HPI 2026 Novice ›

CF 106410A - Harker!!

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now, only the title “Codeforces 106410A - Harker!!” is provided, but there is no description of what the input represents, what needs to be computed, or any constraints.