Beiträge

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

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:

The Two Pointers technique is a strategy commonly used in computer science and programming for solving problems involving arrays or sequences. It involves using two pointers that traverse the array or sequence from different positions, often moving in opposite directions or at different speeds. This technique is particularly useful for solving problems related to searching, optimization, or manipulation of arrays efficiently.

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.

We’re excited to kick off a new competition season and share some updates on Eolymp. Our mission remains the same: hosting regular, high-quality contests for the competitive programming community. This year, we’re running more rounds, adding new formats, and introducing a new reward system.

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.

This article uses terms from linear algebra. If you understand them, you can skip this section.

We're excited to announce the results of the Eolymp Cup! It’s been a long journey, but we made it. We hope you enjoyed the challenges and had a rewarding experience throughout.

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're excited to announce the results of the latest round of the Eolymp Cup! We hope you enjoyed the challenges and had a rewarding experience throughout.

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.

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

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.

Trees are one of the key data structures in algorithms and appear in a wide range of problems.

Even in ancient times, the Egyptians knew that a triangle with sides $3$, $4$, and $5$ is a right triangle, with its right angle being the largest one. Determine whether other triangles also have this property.