TheForces Round #33(Wow-Forces)

6 problems from TheForces Round #33(Wow-Forces) (contest 105293), difficulty -. 0/6 solutions verified against sample I/O.

6 items

TheForces Round #33(Wow-Forces)

Special | 6 problems | 0/6 verified | Difficulty - | 10m 47s

# Problem Rating Tags Accepted Time ✓
A Mr. Wow and Lucky Array 1m 38s
B Mr. Wow and Dislikes 1m 43s
C Mr. Wow and Spells 2m 28s
D Mr.Wow and Multiset 1m 33s
E Mr.Wow and Hidden Permutation 1m 51s
F Mr.Wow and Decoding 1m 34s
Practice › Codeforces Solutions › TheForces Round #33(Wow-Forces) ›

CF 105293E - Mr.Wow and Hidden Permutation

We are given a hidden permutation $p$ of length $n$, where $n equiv 2 pmod 4$. We never see the permutation directly. Instead, we can query any set of exactly $n/2$ distinct indices, and the judge returns the median value among the corresponding $p$-values.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #33(Wow-Forces) ›

CF 105293F - Mr.Wow and Decoding

We are given a circular array of constraints, and we want to construct another array of nonnegative integers that satisfies them while minimizing the total sum.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #33(Wow-Forces) ›

CF 105293C - Mr. Wow and Spells

We are given a row of monsters, each with a positive health value. A spell is an operation where we choose a number x, then scan monsters from left to right. The first monster whose current health is at least x gets reduced by x, and the spell stops immediately.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #33(Wow-Forces) ›

CF 105293B - Mr. Wow and Dislikes

We are given an array of integers. The goal is to repeatedly apply an operation so that, at the end, every element in the array is non-positive. One operation works like this. We pick an index $i$.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #33(Wow-Forces) ›

CF 105293D - Mr.Wow and Multiset

We start with a multiset containing the numbers from 1 to n. Each operation picks two currently present values x and y, removes both, and inserts their difference x − y. After exactly n − 1 such operations, only one number remains.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #33(Wow-Forces) ›

CF 105293A - Mr. Wow and Lucky Array

We are given a binary array where each prefix is tightly constrained: every element is either 0 or 1, and at any prefix position, the number of ones cannot exceed half of the prefix length (rounded down).
codeforces competitive-programming Jun 23, 2026