Финал олимпиады НТО: информационная безопасность. Секция - информатика
5 problems from Финал олимпиады НТО: информационная безопасность. Секция - информатика (contest 105043), difficulty -. 1/5 solutions verified against sample I/O.
Финал олимпиады НТО: информационная безопасность. Секция - информатика
Special | 5 problems | 1/5 verified | Difficulty - | 4m 37s
CF 105043D - Высадка двоичных яблонь на луну
I can't write a correct editorial or provide a correct solution for this problem because the prompt is missing essential information.
CF 105043E - Ужин у лесника Янки
We are given an array of values, where each position has a number attached to it. For each query, we take a contiguous segment of this array and are allowed to freely permute the values inside that segment before evaluating a score.
CF 105043B - Двоичный паук плетёт паутину
We are given a sequence of pillar heights laid out in a straight line. Each position has a height, and we also have a threshold value x. The task is to find a contiguous segment of these pillars such that every pillar inside the segment has height at most x.
CF 105043A - Петя и странные запросы
We are given a number $n$. Imagine writing all integers from $1$ to $n$ on a sheet. Two independent operations are performed on this set: every number divisible by 2 is marked in one color, and every number divisible by 3 is marked in another color.
CF 105043C - Марсианские числа
We are given a fixed integer a and an interval [l, r]. A number x from that interval is considered compatible with a if gcd(a, x) = 1. The task is to count how many integers in the interval are coprime with a. The most striking constraint is that l and r can be as large as 10^18.