TheForces Round #11 (DIV2.5-Forces)

6 problems from TheForces Round #11 (DIV2.5-Forces) (contest 104311), difficulty -. 2/6 solutions verified against sample I/O.

6 items

TheForces Round #11 (DIV2.5-Forces)

Special | 6 problems | 2/6 verified | Difficulty - | 9m 27s

# Problem Rating Tags Accepted Time ✓
A Maximum of n Integers 1m 31s
B Strange Shuffle 2m 2s
C c0=c1 1m 48s ✓
D Big Xor Sum 1m 22s
E Pre-minimum Score 1m 39s
F Span Flip 1m 5s ✓
Practice › Codeforces Solutions › TheForces Round #11 (DIV2.5-Forces) ›

CF 104311E - Pre-minimum Score

We are given a multiset of integers where value i appears exactly mi times. From this multiset we consider every possible permutation of the full expanded array.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › TheForces Round #11 (DIV2.5-Forces) ›

CF 104311F - Span Flip

We are given two binary grids of the same size, call them the starting grid and the target grid. The only allowed move is to choose a contiguous segment of length l either horizontally within a row or vertically within a column, and flip all bits in that segment.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › TheForces Round #11 (DIV2.5-Forces) ›

CF 104311D - Big Xor Sum

We are given an array of length n where the value at position i is i-1, so the array is fixed as [0, 1, 2, ..., n-1]. The task is to consider every contiguous subarray, compute the bitwise XOR of its elements, and sum all those XOR results.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › TheForces Round #11 (DIV2.5-Forces) ›

CF 104311B - Strange Shuffle

We start with an array that initially contains the numbers from 1 to n in order. Then we repeatedly apply a fixed sequence of operations until only one element remains.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › TheForces Round #11 (DIV2.5-Forces) ›

CF 104311C - c0=c1

We are given two binary arrays of equal length. From each array we are allowed to pick one contiguous segment, and the only restriction on each segment is that its length must fall inside a given range.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › TheForces Round #11 (DIV2.5-Forces) ›

CF 104311A - Maximum of n Integers

We are given several test cases. In each test case we receive an array of integers, and we are asked to analyze a faulty piece of code that tries to compute the maximum value of the array.
codeforces competitive-programming Jul 1, 2026