Publicaciones

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

El objetivo de esta lección es introducir a los estudiantes al concepto de recursión, entender sus fundamentos y dominar su implementación en programación. Al final de esta lección, los estudiantes deberían ser capaces de:

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.

Este artículo utiliza términos de álgebra lineal. Si los entiendes, puedes saltarte esta sección.

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

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.

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.