TheForces Round #36 (Starters-Forces)

7 problems from TheForces Round #36 (Starters-Forces) (contest 105445), difficulty -. 0/7 solutions verified against sample I/O.

7 items

TheForces Round #36 (Starters-Forces)

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

# Problem Rating Tags Accepted Time ✓
A Sum Fun 1m 32s
B Interviews 1m 21s
C Sigma Problem (Easy Version) 1m 30s
D YEET! 1m 33s
E Sigma Problem (Hard Version) 1m 39s
F Ranking Random Pick 1m 46s
G Timosh and Set 1m 26s
Practice › Codeforces Solutions › TheForces Round #36 (Starters-Forces) ›

CF 105445G - Timosh and Set

We are given a collection of allowed operations defined by an array of distinct positive integers. Each operation picks one of these integers, say ai, and transforms a current value x into the largest multiple of ai that is strictly less than or equal to x.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #36 (Starters-Forces) ›

CF 105445F - Ranking Random Pick

We are given an array of values, and a stochastic process that repeatedly manipulates it until it becomes empty. At each step, a fair coin decides who acts.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #36 (Starters-Forces) ›

CF 105445E - Sigma Problem (Hard Version)

We are given an array and asked to answer many queries about a very specific aggregation over subarrays. For any segment $[l, r]$, we conceptually look at every starting index $i$ inside it, and from each $i$ we consider every ending index $j ge i$ up to $r$.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #36 (Starters-Forces) ›

CF 105445D - YEET!

We are asked to construct a permutation of the numbers from 1 to n such that every adjacent pair in the permutation avoids two specific “bad interactions” defined using a parameter m.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #36 (Starters-Forces) ›

CF 105445A - Sum Fun

We are asked to decide whether it is possible to construct a number with very rigid structure: it must have exactly n digits, it must be a palindrome, none of its digits can be zero, and the sum of all its digits must be exactly m.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #36 (Starters-Forces) ›

CF 105445C - Sigma Problem (Easy Version)

We are given a single array and asked to compute a very large nested sum built from all contiguous subarrays. For every starting index i, we look at every ending index j ≥ i, compute the product of the subarray a[i] ...
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TheForces Round #36 (Starters-Forces) ›

CF 105445B - Interviews

We are given a small system of interviewers who repeatedly conduct interviews in groups. Each interview consists of exactly z distinct interviewers, and each interviewer can only participate in at most y interviews per day.
codeforces competitive-programming Jun 23, 2026