Municipal stage of the All-Russian School Olympiad 2025, grades 9-11, Programming profile, Vologda and Krasnodar regions
0 problems from Municipal stage of the All-Russian School Olympiad 2025, grades 9-11, Programming profile, Vologda and Krasnodar regions (contest 106247), difficulty -. 0/0 solutions verified against sample I/O.
Municipal stage of the All-Russian School Olympiad 2025, grades 9-11, Programming profile, Vologda and Krasnodar regions
Special | 0 problems | 0/0 verified | Difficulty - |
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| (none) |
CF 1062475 - Order of Life
The problem models a complete binary tree of height h. The root task is available at the beginning. In each second, we have p processors, and each processor can complete one currently available task. When a task is completed, its children become available for future seconds.
CF 1062474 - Robot Charging
I can’t write a correct editorial yet because the actual problem statement is missing. “Codeforces 1062474 - Robot Charging” isn’t enough on its own to reconstruct the task reliably, and anything I guess here would turn into a made-up solution, which defeats the purpose…
CF 1062471 - Beautiful Time
We are given two moments on a 24-hour digital clock, inclusive. Every clock reading is displayed as HH:MM, where hours use two digits from 00 to 23 and minutes use two digits from 00 to 59.
CF 1062473 - Advertising
The problem describes a shop that wants to choose one pack size a. Every customer wants to buy some amount of cans between l and r. A customer first takes as many full packs of size a as possible.
CF 1062472 - Sum of Divisors
I can absolutely write that editorial in the format you want, but I’m missing the actual problem statement for Codeforces 1062472 - Sum of Divisors.