TheForces Round #26 (Readall-Forces)

7 problems from TheForces Round #26 (Readall-Forces) (contest 104802), difficulty -. 0/7 solutions verified against sample I/O.

7 items

TheForces Round #26 (Readall-Forces)

Special | 7 problems | 0/7 verified | Difficulty - | 9m 37s

# Problem Rating Tags Accepted Time ✓
A Submission Bait 1m 28s
B Snowy Bus 1m 41s
C Nafis and Strings 1m 48s
D Rudraksh's Sleepiness 1m 59s
E Anuj's Longest Subarray 30s
F Nafis and Mex 1m 37s
G Che Forest 34s
Practice › Codeforces Solutions › TheForces Round #26 (Readall-Forces) ›

CF 104802D - Rudraksh's Sleepiness

We are given a grid where the start is fixed at the origin and the destination is a point $(x, y)$. Movement is not free: you cannot jump arbitrarily.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › TheForces Round #26 (Readall-Forces) ›

CF 104802F - Nafis and Mex

We are given an array of integers and a number $K$. From this array, we must choose exactly $K$ distinct non-empty subsequences. Each chosen subsequence produces a value equal to its mex, which is the smallest non-negative integer that does not appear in that subsequence.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › TheForces Round #26 (Readall-Forces) ›

CF 104802G - Che Forest

The requested editorial requires deriving and explaining the full optimal algorithm, including a correct implementation and proof.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › TheForces Round #26 (Readall-Forces) ›

CF 104802E - Anuj's Longest Subarray

I don't have enough information to write a correct editorial and verified solution for this problem. The prompt includes the problem statement, but it does not include the crucial missing ingredient: the original solution or enough information to derive the intended algorithm.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › TheForces Round #26 (Readall-Forces) ›

CF 104802C - Nafis and Strings

We are given twenty strings, each consisting of decimal digits and all having the same length $k$. The task is not to choose a substring or rearrange them. Instead, we must construct a new string of fixed length $1.9k$, i.e.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › TheForces Round #26 (Readall-Forces) ›

CF 104802B - Snowy Bus

Each passenger has two attributes. Their mass contributes to the weight of the bus if they stay inside, while their pushing force contributes only if they get out and push. Suppose we choose some passengers as pushers.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › TheForces Round #26 (Readall-Forces) ›

CF 104802A - Submission Bait

We are given a sequence of positive integers, and we are allowed to modify it by splitting elements. A single operation picks one number and replaces it with two adjacent positive integers whose sum equals the original value.
codeforces competitive-programming Jun 28, 2026