2019-2020 Всероссийская олимпиада школьников по информатике, региональный этап, 1 тур
0 problems from 2019-2020 Всероссийская олимпиада школьников по информатике, региональный этап, 1 тур (contest 102479), difficulty -. 0/0 solutions verified against sample I/O.
2019-2020 Всероссийская олимпиада школьников по информатике, региональный этап, 1 тур
Special | 0 problems | 0/0 verified | Difficulty - |
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| (none) |
CF 1024792 - Превышение скорости
We have a road split into (n) consecutive sections. Section (i) has length (li) and a speed limit (vi). A car enters the road at time (s), leaves it at time (t), and we know nothing about its exact speed on individual sections.
CF 1024793 - Борьба с рутиной
We have a sequence a[1..n], where a[i] is the type of work performed on day i. For every length d from 1 to n, consider every contiguous segment of exactly d days. For each such segment, count how many different work types occur inside it, then add these counts together.
CF 1024794 - Олимпиада для роботов
We have a table with m rows and n columns. Each row belongs to one robot participant, and each row has its own Boolean program. In every column, the values are a permutation of 0, 1, ..., m - 1, so every value occurs exactly once in that column.
CF 1024791 - Разность квадратов
We need to find positive integers (x) and (y) such that [ x^2-y^2=n, ] where (0le nle 2^{60}), and both (x) and (y) must be at most (2^{62}-1). If such a pair exists, we may output any one of them. Otherwise, we print No.