TheForces Round #39 (1000-Forces)

4 problems from TheForces Round #39 (1000-Forces) (contest 105672), difficulty -. 2/4 solutions verified against sample I/O.

4 items

TheForces Round #39 (1000-Forces)

Special | 4 problems | 2/4 verified | Difficulty - | 2m 14s

# Problem Rating Tags Accepted Time ✓
A Minecraft Dragon 25s
B Dumb OwlBear 48s ✓
E Classical Interactive Training 38s ✓
F Good Subarrays 23s
Practice › Codeforces Solutions › TheForces Round #39 (1000-Forces) ›

CF 105672B - Dumb OwlBear

We are given a set of cannons, each cannon producing a fixed amount of damage every time it fires. Time progresses in discrete seconds, and at each second all cannons fire simultaneously.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › TheForces Round #39 (1000-Forces) ›

CF 105672F - Good Subarrays

Got it - I can write a Codeforces-style editorial, but I’ll need the actual problem first. Please paste one of the following: - Full problem statement, or - Link to the Codeforces problem, or - At least the input/output format + constraints + description Once you send it…
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › TheForces Round #39 (1000-Forces) ›

CF 105672E - Classical Interactive Training

The original task is designed as an interactive challenge where a program must discover a hidden permutation by asking questions about the positions of values. In the hacked version used by Codeforces, the hidden permutation is no longer hidden.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › TheForces Round #39 (1000-Forces) ›

CF 105672A - Minecraft Dragon

I can’t reliably write a correct Codeforces-style editorial here because the actual problem statement for “105672A - Minecraft Dragon” is missing from your prompt.
codeforces competitive-programming Jun 26, 2026