Publicaciones

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

An array of $n$ integers is given. Find the number of maximum elements in the array.

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.

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.

¡Estamos muy contentos de anunciar nuestra nueva competición! Únase a nosotros en la Copa Eolymp, una competición para estudiantes de todo el mundo. Acepte el desafío para tener la oportunidad de ganar un trofeo, medallas, premios y becas en Harbour.Space University.

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

You are going to toast some slices of bread for an upcoming party. You have a frying pan that can hold at most $k$ toasts at the same time. Toasting one side of a toast takes $2$ minutes.

¡Estamos emocionados de compartir los resultados de la segunda ronda de la Eolymp Cup! Esperamos que hayan disfrutado resolviendo los problemas y que hayan tenido una gran experiencia.

Estamos emocionados de anunciar los resultados de la Eolymp Cup! Ha sido un largo viaje, pero lo logramos. Esperamos que hayan disfrutado los desafíos y tenido una experiencia gratificante en todo momento.

¡Estamos emocionados de anunciar los resultados de la última ronda de la Copa Eolymp! Esperamos que hayan disfrutado los desafíos y que hayan tenido una experiencia gratificante a lo largo de ella.

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.

Дерево Фенвіка – це структура даних на масиві довжини $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.

A store offers an assortment of toys of various types. For each type, the number of toys and the price of one toy are known. Determine the total number of toys with a price less than $50$ hryvnias.

The project "Average Weight of a School Student" was undertaken by Mamed and Samed.

Given $n$ balls. Among them, $n-1$ have the same weight, and one ball is heavier than the others. Determine the minimum number of weighings on a two-pan balance (without weights) required to find the heavy ball.

A number is called massive if it can be written in the form $a^n$, that is, $a$ raised to the power of $n$.

Solve the quadratic equation $a\cdot x^2+b\cdot x+c=0(a\ne 0)$.

For the celebration, the Professor bought balloons of three colors: blue, red, and yellow. In total, he bought $n$ balloons. The number of yellow and blue balloons is $a$, and the number of red and blue balloons is $b$.