HAMMERWARS 2025

9 problems from HAMMERWARS 2025 (contest 106195), difficulty -. 4/9 solutions verified against sample I/O.

9 items

HAMMERWARS 2025

Special | 9 problems | 4/9 verified | Difficulty - | 5m 30s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Coloring book				25s
E	Research				28s
F	Peter's polygon problem				25s
G	Positivity				53s	✓
H	Equivalence classes				45s	✓
I	Complete and complement				44s	✓
J	Immense integers				24s
K	Sadism				44s	✓
L	Birthday bash				42s

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195L - Birthday bash

I’m not able to provide a reliable editorial and accepted Python solution for this problem right now. The geometry/probability step that determines the expected second-smallest slice area is non-trivial, and I don’t have enough confidence in a derived algorithm to write a…

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195K - Sadism

We are given a sequence of integers representing some initial state, and we are asked to transform it into another sequence where each position depends on how the elements relate to each other globally rather than locally.

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195J - Immense integers

Sure. Please provide the Codeforces problem statement (or a link/name), and I’ll write a detailed competitive programming editorial covering: - Problem restatement - Key observations - Derivation of the main idea - Algorithm - Proof of correctness - Complexity analysis -…

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195G - Positivity

We are given an integer array and a permutation. The permutation describes a collection of disjoint cycles: every index points to another index, and no index points to itself. The operation chooses an index x and changes the signs of both a[x] and a[p[x]].

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195I - Complete and complement

We are given a binary matrix that can be thought of as a pattern together with its logical “opposite.” Each cell is either present or absent, and the task revolves around producing two related structures: one that is complete in the sense of connecting everything that is…

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195H - Equivalence classes

The problem asks us to count how many different sequences of operations can create a given number of equivalence classes. We start with n elements that are all considered identical.

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195E - Research

Sure-send me the full problem statement (or a link / screenshot text), and I’ll write a proper Codeforces-style editorial for it. If you want, also tell me: - target difficulty (e.g.

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195B - Coloring book

Sure. Please provide the Codeforces problem statement (or a link/name/number), and I’ll write a detailed competitive programming editorial covering: - Problem restatement - Key observations - Derivation of the algorithm - Proof of correctness - Complexity analysis -…

Practice › Codeforces Solutions › HAMMERWARS 2025 ›

CF 106195F - Peter's polygon problem

I can write the full editorial, but I need the actual problem statement first. The Codeforces Gym page for 106195F - Peter's polygon problem does not expose the statement text in the available view, only the title, limits, and samples.