On May 19, at 16:00 UTC the second competition of the Eolymp Weekend Practice series will take place. Learn more on the competition website.

Format and Difficulty

Same as the first round, the competition is primarily aimed at improving practical skills. There will be 5 tasks of varying difficulty, the easiest of which can even be solved by beginners.

The scoring for each task being block-based (meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block). If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made earlier will be ranked higher in the leaderboard.

This series has a standard duration of two hours.

The statements will be available in the following languages: English, Ukrainian, Russian, Polish, German, French, Spanish, Azerbaijani.

Registration

You can register for the competition on its page.

Thanks a lot to:

• arsijo for coordinating the contest
• Sergey Kolodyazhnyy for creating Eolymp
• Umanity, Do_not_make_friends, Frus for authoring the problems
• peltorator, 160cm, TheQuantiX, Ignut, Geforgs, Fatonim_, Melissa_14 for testing the contest

Prizes

The top-10 participants of the competition, as well as 10 random participants from those who rank from 11th to 100th place, will receive prizes in the form of t-shirts. Please, note, that we have changed how prizes are awarded,

• We will send prizes for free to EU countries (with few exceptions), Ukraine and Azerbaijan. If you live in another country, we still may arrange delivery for you, but additional conditions and fees may apply.

• If you already got a T-Shirt in the first round, we will not send you another one, because it will be excatly the same.

Visit Frequently Asked Questions section to learn more.

UPD:

Congrats to the winners:

• VladProg
• wakaka
• Triseedot
• nfssdq
• andr1y
• Psiuk_Yurii
• xGaz_
• Valera_Grinenko
• Tahirliyev
• Wansur

Next Sunday, March 24, at 16:00 UTC the first competition of the Eolymp Weekend Practice series will take place.

Format and Difficulty

As the name suggests, this series of competitions is primarily aimed at improving practical skills. There will be 5 tasks of varying difficulty, the easiest of which can even be solved by beginners.

The distribution of points by tasks is 50-100-200-300-350, with scoring for each task being block-based (meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block). If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made earlier will be ranked higher in the leaderboard.

This series has a standard duration of two hours.

The statements will be available in the following languages: English, Ukrainian, Russian, Polish, German, French, Spanish, Azerbaijani.

Registration

You can register for the competition on its page.

Prizes

The top-10 participants of the competition, as well as 10 random participants from those who rank from 11th to 100th place, will receive prizes in the form of t-shirts. Please note that Eolymp currently sends prizes only to countries that are part of the Council of Europe.

Read more

UPD:

Congrats to the winners!:

1. andrey27sm

2. NK_

3. TheQuantiX

4. MAKMED1337

5. esomer

6. thenymphsofdelphi

7. huz_n

8. fuad27

9. Glauco

10. Sahib_

The editorial is available by the following links:

1. The Cubes
2. The Strings
3. Some Complex Formulas
4. Scared String!
5. Is This FFT?

Hello codeforces!

Recently in the problem I came across with this data structure, which can perform this operations:

• add element

• delete element

• return the maximal of it

with O(1) for query.

So the question is simple: is it exist?

Дан массив целых чисел a(len(a) < 10^5, 1 <= a[i] <= 10^9)

дано q запросов двух типов

В первом из них заданы два числа x(0 <= x < len(a)) и y(1 <= y <= 10^9) требуется изменить елемент массива а с позицией x на y

Во втором же заданы два числа: l,r(0 <= l < len(a), 0<= r < len(a), l < r) требуется найти два разных таких индекса x1,x2 принадлежащих отрезку от l до r включительно таких что их НОД будет максимально возмжным из всех пар(вывести его)

Я умею решать эту задачу полным перебором O(q*n^2) но мне лично интересно узнать есть ли решение за нормальную асимптотику(O(q*log(N))).