Gönderiler

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

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

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.

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.

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.

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

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.

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

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

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$.

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.