Municipal stage of ROI 2024, grades 9-11, Vologda and Krasnodar regions
5 problems from Municipal stage of ROI 2024, grades 9-11, Vologda and Krasnodar regions (contest 105600), difficulty -. 3/5 solutions verified against sample I/O.
Municipal stage of ROI 2024, grades 9-11, Vologda and Krasnodar regions
Special | 5 problems | 3/5 verified | Difficulty - | 3m 13s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Repair Again | 42s | ✓ | |||
| B | Approval of Requests | 24s | ||||
| C | Triangles | 21s | ||||
| D | Masha and Gleb are Moving | 40s | ✓ | |||
| E | Dima on Fishing | 1m 6s | ✓ |
CF 105600B - Approval of Requests
Sure - I can do that, but I’ll need the actual problem first. Please paste the Codeforces problem statement (or at least the link / key parts like constraints and sample tests), and tell me if you want: - full editorial (idea + proof + implementation) - or just intuition +…
CF 105600C - Triangles
I can absolutely write that editorial, but I don't have enough information yet. The Gym problem Codeforces 105600C - Triangles does not expose the official editorial or solution, and your prompt only includes empty placeholders for the statement.
CF 105600A - Repair Again
We are given a rectangular wall that must be covered from left to right using vertical wallpaper strips. Each strip is cut from a roll of wallpaper. A roll has fixed width and finite length.
CF 105600E - Dima on Fishing
We are given a timeline of length $t$. Each minute exactly one fishing rod produces a bite, and that rod is known in advance for every minute. Dima starts at the center of an island at time zero.
CF 105600D - Masha and Gleb are Moving
We are given a sequence of numbers that grows one element at a time. After reading the first k elements, Masha and Gleb play a game on that prefix and repeatedly combine two chosen elements into a single new value until only one number remains.