TheForces Round #45 (DIV3-Forces2)

8 problems from TheForces Round #45 (DIV3-Forces2) (contest 106177), difficulty -. 4/8 solutions verified against sample I/O.

8 items

TheForces Round #45 (DIV3-Forces2)

Special | 8 problems | 4/8 verified | Difficulty - | 5m 56s

# Problem Rating Tags Accepted Time ✓
A OR what? 26s
B Weird Function 56s ✓
C Rare Function 48s ✓
D Daydream 35s ✓
E Max Subarray Sum 54s ✓
F Bamboozle 30s
G Binary Tree Traversal 1m 21s
H Kaosar and Path 26s
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177G - Binary Tree Traversal

I can write the editorial, but the problem statement provided in the prompt is missing the actual details under “Problem Statement”, “Input”, and “Output”.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177H - Kaosar and Path

Something went wrong while generating the response. If this issue persists please contact us through our help center at [help.openai.com](https://help.openai.com/).
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177E - Max Subarray Sum

We are given an array of integers and we are allowed to remove exactly one contiguous segment from it. After removing that segment, the remaining elements are glued together without changing order, producing a new array.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177F - Bamboozle

I can write the editorial, but I’m missing the actual problem statement for Codeforces 106177F - Bamboozle. The problem ID appears to be from a Codeforces Gym contest rather than the main problemset, and I could not reliably retrieve the statement or constraints from the…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177D - Daydream

The map is a rectangular island grid. Some cells are sea and cannot be entered, while the remaining cells are land. A few land cells contain unique sights represented by uppercase letters.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177B - Weird Function

We are given a positive integer n. For any chosen positive integer m, we look at the function f(m, i) for every divisor candidate i from 1 to n. The function contributes 1 exactly when dividing m by i leaves remainder 1, otherwise it contributes 0.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177C - Rare Function

The task defines a very small predicate on two integers: for a fixed pair $(x, y)$, the value $f(x, y)$ equals 1 only when dividing $x$ by $y$ leaves remainder exactly 1, and is 0 otherwise. For each test case, we are given two integers $n$ and $m$.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › TheForces Round #45 (DIV3-Forces2) ›

CF 106177A - OR what?

I can write the editorial, but the actual problem statement for Codeforces 106177A - “OR what?” is missing from the prompt.
codeforces competitive-programming Jun 25, 2026