Invitational stage of the All-Russian Olympiad in Informatics for schoolchildren
0 problems from Invitational stage of the All-Russian Olympiad in Informatics for schoolchildren (contest 104441), difficulty -. 0/0 solutions verified against sample I/O.
Invitational stage of the All-Russian Olympiad in Informatics for schoolchildren
Special | 0 problems | 0/0 verified | Difficulty - |
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| (none) |
CF 1044414 - Claims Processing
We are given a line of claims stacked from top to bottom, numbered by their original positions. The boss repeatedly processes the pile in fixed groups of three actions.
CF 1044415 - Beware, Evil Numbers!
We are asked to count integers in the range from 1 to n that satisfy two conditions at the same time. First, the number must be even. Second, when we write that number in binary, the number of set bits, meaning the number of ones in its binary representation, must also be even.
CF 1044412 - Switching TV-Channels
We are working with a linear sequence of TV channels labeled from 1 to N. Lisa starts on some channel P and wants to reach another channel U using a remote control with two buttons. Each button has two behaviors depending on how it is pressed.
CF 1044413 - Treasure Hunter
We are given a straight horizontal road modeled as the x-axis. Timofey places a metal detector at two different positions on this line. First he stands at the origin and sets the detector range to a value r₁, then he moves to position x = a and sets the range to r₂.
CF 1044411 - Long training
The task is to compute the total duration of a training session that is composed of repeated work blocks separated by rest periods. Each training session consists of $N$ identical sets. One set takes a fixed amount of time given in minutes and seconds.