Feed

We're thrilled to share the results of the second round of the Eolymp Cup! We hope you enjoyed tackling the problems and had a great experience.

We are happy to announce that Osijek camp will be returning this Autumn, on August 31-September 8 2024, right before the ICPC World Finals 2024 on 15-20 September 2024 in Astana, Kazakhstan. The camp is hosted by the School of Applied Mathematics and Computer Science of the University of Osijek and is brought to you by the organizing team of @adamant and @-is-this-fft-.

We are excited to announce new Weekend Practice round next Saturday. This is rated competition for everyone.

You may have noticed some changes on our site today, specifically some new colors and changes on the profile page. We’ve introduced a system that assigns titles to users based on their performance in rated competitions like the Eolymp Cup and Weekend Practice. These titles help organize users into groups according to their performance and provide a bit of motivation to solve more problems.

We're excited to announce the results of the first round of the Eolymp Cup! We had nearly a thousand participants from over 70 countries. We hope everyone enjoyed the problems and had a great time.

We are very excited to announce our new competition! Join us at Eolymp Cup, a programming competition for students from everywhere! Take up a challenge to get a chance to win a trophy, medals, prizes, and scholarships at Harbour.Space University.

The objective of this lesson is to introduce students to the concept of recursion, understanding its fundamentals, and mastering its implementation in programming. By the end of this lesson, students should be able to:

We are inviting authors to participate in designing problems for Eolymp Weekend Practice. The authors will receive rewards and various gifts. If you are interested, contact us.

A combination of $n$ elements taken $k$ at a time is a set of $k$ elements chosen from the given $n$ elements. In this context, sets that differ only in the order of the elements (but not in their composition) are considered identical. It is precisely this property of combinations that distinguishes them from permutations.

Congratulations to all participants who have been selected to represent Ukraine at different European and International Olympiads.

Thanks for participating in Weekend Practice yesterday. We hope you had fun solving the problems. Problems are already available for upsolving along with editorials: The Chess Board, Pets and Friends, The Legend Was Invented, but Not the Name, Chasing Chmyaaax and The Root of Evil.

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.

Ukrainian Olympiad in Informatics 2024 took place from 29-th of March to 2-nd of April 2024 in Chernivtsi, Ukraine. Eolymp was used to host this competition.

Thanks for participating in Weekend Practice yesterday. We hope you had fun solving the problems, even though we've started the event with an outage. We apologize for the outage and will make sure the next round will go much smoother.

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

Today we'll take a look at how Eolymp tests submissions: what happens after you submit a solution,how it is executed, how the results are verified and what outcomes there are. Hope this article will help you betterunderstand how the system works and make it easier to work with it.

Hello everybody! My name is Sergey Kolodyazhnyy and I am one of the co-founders of the Eolymp. Today I would like to share with you the story of how my computer science teacher Zhukovsky Serhiy (@zss) and I created one of the largest Ukrainian sites for studying computer science. Of course, over the years, many caring people have helped the site. This post mentions only a few of them, but I am very grateful to everyone who contributed.

Пусть есть страна $G$, в которой есть множество городов (обозначим это множество как $V$), и множество дорог, соединяющих пары городов (обозначим их как $E$). Не факт, что каждая пара городов соединена дорогой. Иногда, чтобы добраться из одного города в другой, следует посетить несколько транзитных городов. У дорог есть длина. В стране $G$ есть город-столица $s$. Необходимо найти кратчайшие пути из столицы до всех остальных городов.

Дерево Фенвіка – це структура даних на масиві довжини $n$, яка дозволяє виконувати наступні операції: